{"id":"https://openalex.org/W2734543612","doi":"https://doi.org/10.1145/3077581","title":"Improved Approximation Algorithm for Steiner <i>k</i> -Forest with Nearly Uniform Weights","display_name":"Improved Approximation Algorithm for Steiner <i>k</i> -Forest with Nearly Uniform Weights","publication_year":2017,"publication_date":"2017-07-13","ids":{"openalex":"https://openalex.org/W2734543612","doi":"https://doi.org/10.1145/3077581","mag":"2734543612"},"language":"en","primary_location":{"id":"doi:10.1145/3077581","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3077581","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-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/A5049161363","display_name":"Michael Dinitz","orcid":"https://orcid.org/0000-0002-2632-966X"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael Dinitz","raw_affiliation_strings":["Johns Hopkins University, Baltimore, MD"],"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, Baltimore, MD","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056370891","display_name":"Guy Kortsarz","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guy Kortsarz","raw_affiliation_strings":["Rutgers University, Camden, NJ"],"affiliations":[{"raw_affiliation_string":"Rutgers University, Camden, NJ","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003622145","display_name":"Zeev Nutov","orcid":"https://orcid.org/0000-0002-6629-3243"},"institutions":[{"id":"https://openalex.org/I164950643","display_name":"Open University of Israel","ror":"https://ror.org/027z64205","country_code":"IL","type":"education","lineage":["https://openalex.org/I164950643"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Zeev Nutov","raw_affiliation_strings":["The Open University of Israel, Raanana, Israel"],"affiliations":[{"raw_affiliation_string":"The Open University of Israel, Raanana, Israel","institution_ids":["https://openalex.org/I164950643"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5049161363"],"corresponding_institution_ids":["https://openalex.org/I145311948"],"apc_list":null,"apc_paid":null,"fwci":0.9085,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76594349,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"13","issue":"3","first_page":"1","last_page":"16"},"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.9998999834060669,"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.9998999834060669,"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.9987000226974487,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.7633826732635498},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6754830479621887},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6068081855773926},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5378026366233826},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4978315830230713},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36677467823028564}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7633826732635498},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6754830479621887},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6068081855773926},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5378026366233826},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4978315830230713},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36677467823028564}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3077581","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3077581","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5273065996","display_name":null,"funder_award_id":"1464239, 1218620 and 1540547","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W268194639","https://openalex.org/W1965255372","https://openalex.org/W1971222832","https://openalex.org/W1976584101","https://openalex.org/W1991055327","https://openalex.org/W2002041206","https://openalex.org/W2011823863","https://openalex.org/W2017280430","https://openalex.org/W2029933769","https://openalex.org/W2030365814","https://openalex.org/W2036836182","https://openalex.org/W2038190710","https://openalex.org/W2080551019","https://openalex.org/W2092534058","https://openalex.org/W2109721451","https://openalex.org/W2112112676","https://openalex.org/W2137716917","https://openalex.org/W2153952206","https://openalex.org/W2952587604","https://openalex.org/W4249586771"],"related_works":["https://openalex.org/W3187836939","https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W328736688"],"abstract_inverted_index":{"In":[0,63],"the":[1,89,101,135,151,190,206,210],"Steiner":[2,76,126],"k":[3,22,39,57,77,127,212,216,280,304],"-Forest":[4,78,128],"problem,":[5,218],"we":[6,204,220],"are":[7],"given":[8],"an":[9,20],"edge":[10,295],"weighted":[11],"graph,":[12],"a":[13,32,227,261,267,284,329],"collection":[14],"D":[15,25],"of":[16,209,271,273,287,337],"node":[17,291,323],"pairs,":[18],"and":[19,116,129,248,260,293,325],"integer":[21],"\u2a7d":[23],"|":[24],"|.":[26],"The":[27,41,93,185,278,297],"goal":[28],"is":[29,48,69,154,175,182,189,283,306],"to":[30,319],"find":[31,266],"min-weight":[33],"subgraph":[34,270],"that":[35,72,149],"connects":[36],"at":[37,275],"least":[38,276],"pairs.":[40],"best":[42,299],"known":[43,97,300],"ratio":[44,73,80,110,122,164,301,318],"for":[45,75,88,98,125,142,187,193,302,321],"this":[46,143,194,317],"problem":[47,195,282],"min":[49],"{":[50,240,252],"O":[51,55,81,111,136,155,165],"(\u221a":[52,56,112,137],"n":[53,86,113,123,138,157,167,179,307,332],"),":[54,159,173],")}":[58],"[Gupta":[59],"et":[60,65,106,312],"al.":[61,66,107,313],"2010].":[62],"Gupta":[64,105],"[2010],":[67,108],"it":[68],"also":[70,147],"shown":[71],"\u03c1":[74],"implies":[79],"(\u03c1":[82],"\u00b7":[83,171],"log":[84],"2":[85],")":[87,114,139,235],"related":[90],"Dial-a-Ride":[91,130,188],"problem.":[92],"only":[94],"other":[95],"algorithm":[96],"Dial-a-Ride,":[99],"besides":[100],"one":[102,161],"resulting":[103],"from":[104],"has":[109],"[Charikar":[115],"Raghavachari":[117],"1998].":[118],"We":[119,146,315],"obtain":[120],"approximation":[121,140],"0.448":[124,172],"with":[131,236,289],"unit":[132,290,294],"weights,":[133],"breaking":[134],"barrier":[141],"natural":[144],"case.":[145],"show":[148],"if":[150,180],"maximum":[152],"edge-weight":[153],"(":[156,166,231],"\u03f5":[158,181,310],"then":[160],"can":[162],"achieve":[163],"(1":[168],"+":[169,309],"\u03f5)":[170],"which":[174,219,334],"less":[176],"than":[177],"\u221a":[178],"small":[183],"enough.":[184],"improvement":[186],"first":[191],"progress":[192],"in":[196,331],"15":[197],"years.":[198],"To":[199],"prove":[200],"our":[201],"main":[202],"result,":[203],"consider":[205],"following":[207],"generalization":[208],"Minimum":[211],"-Edge":[213],"Subgraph":[214,224],"(M":[215],"-ES)":[217],"call":[221],"Min-Cost":[222],"\u2113-Edge-Profit":[223],"(MC\u2113-EPS):":[225],"Given":[226],"graph":[228],"G":[229,272],"=":[230,239,251],"V":[232,258],",":[233,333],"E":[234,246],"edge-profits":[237],"p":[238,241],"e":[242,244],":":[243,255],"\u2208":[245,257],"}":[247],"node-costs":[249],"c":[250,253],"v":[254,256],"},":[259],"lower":[262],"profit":[263],"bound":[264],"\u2113,":[265],"minimum":[268],"node-cost":[269],"edge-profit":[274],"\u2113.":[277],"M":[279,303],"-ES":[281,305],"special":[285],"case":[286],"MC\u2113-EPS":[288,320],"costs":[292,324],"profits.":[296],"currently":[298],"3-2\u221a2":[308],"[Chlamtac":[311],"2012].":[314],"extend":[316],"general":[322],"profits":[326],"bounded":[327],"by":[328],"polynomial":[330],"may":[335],"be":[336],"independent":[338],"interest.":[339]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}