{"id":"https://openalex.org/W2141950383","doi":"https://doi.org/10.1109/icnc.2012.78","title":"Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs","display_name":"Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W2141950383","doi":"https://doi.org/10.1109/icnc.2012.78","mag":"2141950383"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2012.78","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.78","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Third International Conference on Networking and Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028085392","display_name":"Mitsuru Kusumoto","orcid":null},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]},{"id":"https://openalex.org/I4210129581","display_name":"Kyoto University of Education","ror":"https://ror.org/03zhhr656","country_code":"JP","type":"education","lineage":["https://openalex.org/I4210129581"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Mitsuru Kusumoto","raw_affiliation_strings":["School of Informatics, Kyoto University, Japan","Kyoto univ"],"affiliations":[{"raw_affiliation_string":"School of Informatics, Kyoto University, Japan","institution_ids":["https://openalex.org/I22299242"]},{"raw_affiliation_string":"Kyoto univ","institution_ids":["https://openalex.org/I22299242","https://openalex.org/I4210129581"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038701345","display_name":"Yuichi Yoshida","orcid":"https://orcid.org/0000-0001-8919-8479"},"institutions":[{"id":"https://openalex.org/I4210166566","display_name":"Preferred Networks (Japan)","ror":"https://ror.org/05xeefy56","country_code":"JP","type":"company","lineage":["https://openalex.org/I4210166566"]},{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuichi Yoshida","raw_affiliation_strings":["National Institute of Informatics, Japan","Preferred Infrastruct., Inc., Japan"],"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Japan","institution_ids":["https://openalex.org/I184597095"]},{"raw_affiliation_string":"Preferred Infrastruct., Inc., Japan","institution_ids":["https://openalex.org/I4210166566"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031213478","display_name":"Hiro Ito","orcid":"https://orcid.org/0000-0001-6975-0422"},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiro Ito","raw_affiliation_strings":["University of Electro-Communications, Japan","the University of Electro-Communications"],"affiliations":[{"raw_affiliation_string":"University of Electro-Communications, Japan","institution_ids":["https://openalex.org/I20529979"]},{"raw_affiliation_string":"the University of Electro-Communications","institution_ids":["https://openalex.org/I20529979"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028085392"],"corresponding_institution_ids":["https://openalex.org/I22299242","https://openalex.org/I4210129581"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16611272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"407","last_page":"413"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6836763024330139},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6829566955566406},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.643998384475708},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6281623840332031},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5345767140388489},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4960077702999115},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4546296298503876},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4136066734790802},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.41267693042755127},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.412122517824173},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4045664966106415},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39856576919555664},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31801921129226685}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6836763024330139},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6829566955566406},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.643998384475708},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6281623840332031},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5345767140388489},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4960077702999115},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4546296298503876},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4136066734790802},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.41267693042755127},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.412122517824173},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4045664966106415},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39856576919555664},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31801921129226685},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2012.78","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2012.78","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Third International Conference on Networking and Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1504952479","https://openalex.org/W1539682630","https://openalex.org/W1970630090","https://openalex.org/W1980816908","https://openalex.org/W1982512167","https://openalex.org/W1999617330","https://openalex.org/W2004019877","https://openalex.org/W2022140055","https://openalex.org/W2023060210","https://openalex.org/W2082227928","https://openalex.org/W2083157001","https://openalex.org/W2083280764","https://openalex.org/W2109330224","https://openalex.org/W2116953739","https://openalex.org/W2147755199","https://openalex.org/W2953253371","https://openalex.org/W4246185962","https://openalex.org/W6630026779"],"related_works":["https://openalex.org/W2057903654","https://openalex.org/W2113270940","https://openalex.org/W2004283824","https://openalex.org/W2963158951","https://openalex.org/W2070751425","https://openalex.org/W1982530285","https://openalex.org/W2118860231","https://openalex.org/W2085573573","https://openalex.org/W1992104669","https://openalex.org/W2521054645"],"abstract_inverted_index":{"We":[0,118],"propose":[1],"constant-time":[2],"algorithms":[3],"for":[4,73,146,160],"approximating":[5],"the":[6,9,14,77,86,89,114,156,180,183],"weight":[7,11,87,91,181],"of":[8,53,88,99,116,124,155,182],"maximum":[10,90],"branching":[12,24,92],"in":[13,42,47,50,93,152,189],"general":[15],"graph":[16,20],"model.":[17],"A":[18],"directed":[19],"is":[21,27,57,113],"called":[22],"a":[23,121,190],"if":[25],"it":[26,150,174],"acyclic":[28],"and":[29,63,70],"each":[30],"vertex":[31,75],"has":[32],"at":[33,100],"most":[34,101],"one":[35],"incoming":[36,71],"edge.":[37],"An":[38],"edge-weighted":[39],"digraph":[40],"G,":[41],"which":[43],"weights":[44],"are":[45,65],"given":[46,58],"real":[48],"values":[49],"[0,":[51],"1],":[52],"average":[54],"degree":[55],"d":[56],"as":[59],"an":[60,96],"oracle":[61],"access,":[62],"we":[64,171],"allowed":[66],"to":[67,136,178],"ask":[68],"degrees":[69],"edges":[72],"every":[74],"through":[76],"oracle.":[78],"Then,":[79],"with":[80,95,103,138,162],"high":[81],"probability,":[82],"our":[83,131],"algorithm":[84,132],"estimates":[85],"G":[94],"absolute":[97],"error":[98],"\u03b5n":[102],"query":[104,139],"complexity":[105,140],"O(d/\u03b5":[106],"<sup":[107,126,142,164],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[108,127,143,165],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3</sup>":[109],"),":[110],"where":[111],"n":[112],"number":[115],"vertices.":[117],"also":[119],"show":[120,172],"lower":[122],"bound":[123],"\u03a9(d/\u03b5":[125],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[128,166],").":[129],"Additionally,":[130],"can":[133],"be":[134],"modified":[135],"run":[137],"O(1/\u03b5":[141],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">4</sup>":[144],")":[145,167],"unweighted":[147],"digraphs,":[148],"i.e.,":[149],"runs":[151],"time":[153],"independent":[154],"input":[157],"size":[158],"even":[159],"digraphs":[161],"\u03a9(n":[163],"edges.":[168],"In":[169],"contrast,":[170],"that":[173],"requires":[175],"\u03a9(n)":[176],"queries":[177],"approximate":[179],"minimum":[184],"(or":[185],"maximum)":[186],"spanning":[187],"arborescence":[188],"weighted":[191],"digraph.":[192]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}