{"id":"https://openalex.org/W2118639405","doi":"https://doi.org/10.1145/1536414.1536504","title":"A constant-factor approximation for stochastic Steiner forest","display_name":"A constant-factor approximation for stochastic Steiner forest","publication_year":2009,"publication_date":"2009-05-31","ids":{"openalex":"https://openalex.org/W2118639405","doi":"https://doi.org/10.1145/1536414.1536504","mag":"2118639405"},"language":"en","primary_location":{"id":"doi:10.1145/1536414.1536504","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536504","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Carnegie Mellon University, PIttsburgh, PA, USA","Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, PIttsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pa., USA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029407896","display_name":"Amit Kumar","orcid":"https://orcid.org/0000-0002-3965-6627"},"institutions":[{"id":"https://openalex.org/I64295750","display_name":"Indian Institute of Technology Indore","ror":"https://ror.org/01hhf7w52","country_code":"IN","type":"education","lineage":["https://openalex.org/I64295750"]},{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Amit Kumar","raw_affiliation_strings":["Indian Institute of Technology, New Delhi, India","Indian Institute of Technology, New Delhi,India#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Indian Institute of Technology, New Delhi,India#TAB#","institution_ids":["https://openalex.org/I64295750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"659","last_page":"668"},"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.9991000294685364,"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.9991000294685364,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7672989368438721},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7446864247322083},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7203184962272644},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5317030549049377},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.49886369705200195},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4812304973602295},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.4674200713634491},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40816158056259155},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3713127374649048}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7672989368438721},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7446864247322083},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7203184962272644},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5317030549049377},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.49886369705200195},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4812304973602295},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.4674200713634491},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40816158056259155},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3713127374649048},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1536414.1536504","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536504","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.150.4053","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.150.4053","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~anupamg/papers/stoc09-ssf.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land","score":0.6700000166893005}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1484951415","https://openalex.org/W1523452202","https://openalex.org/W1528210381","https://openalex.org/W1532411173","https://openalex.org/W1981673685","https://openalex.org/W1998608896","https://openalex.org/W2001139415","https://openalex.org/W2002285507","https://openalex.org/W2011232221","https://openalex.org/W2011823863","https://openalex.org/W2057974767","https://openalex.org/W2075163336","https://openalex.org/W2078850190","https://openalex.org/W2096881311","https://openalex.org/W2097181193","https://openalex.org/W2106676868","https://openalex.org/W2112058494","https://openalex.org/W2121638441","https://openalex.org/W2133156969","https://openalex.org/W2133219745","https://openalex.org/W2140844111","https://openalex.org/W2147954430","https://openalex.org/W2149929647","https://openalex.org/W2163150343","https://openalex.org/W2169143327","https://openalex.org/W6653086227","https://openalex.org/W6679728572"],"related_works":["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","https://openalex.org/W2404561224"],"abstract_inverted_index":{"We":[0,111],"consider":[1],"the":[2,31,40,61,67,86,89,93,113],"stochastic":[3,82,94],"Steiner":[4,14,95],"forest":[5,15],"problem:":[6],"suppose":[7],"we":[8,48,53],"were":[9,18],"given":[10],"a":[11,21,58,120],"collection":[12],"of":[13,24,33,42,92,115],"instances,":[16],"and":[17],"guaranteed":[19],"that":[20,52],"random":[22],"one":[23],"these":[25],"instances":[26],"would":[27],"appear":[28],"tomorrow;":[29],"moreover,":[30],"cost":[32,41],"edges":[34,43,46],"tomorrow":[35],"will":[36],"be":[37],"\u03bb":[38],"times":[39],"today.":[44],"Which":[45],"should":[47],"buy":[49],"today":[50],"so":[51],"can":[54],"extend":[55],"it":[56],"to":[57,65],"solution":[59],"for":[60,78,108],"instance":[62],"arriving":[63],"tomorrow,":[64],"minimize":[66],"expected":[68],"total":[69],"cost?":[70],"While":[71],"very":[72],"general":[73],"results":[74],"have":[75],"been":[76],"developed":[77],"many":[79],"problems":[80],"in":[81],"discrete":[83],"optimization":[84],"over":[85],"past":[87],"years,":[88],"approximation":[90,124],"status":[91,114],"Forest":[96],"problem":[97,117],"has":[98],"remained":[99],"open,":[100],"with":[101],"previous":[102],"works":[103],"yielding":[104],"constant-factor":[105,121],"approximations":[106],"only":[107],"special":[109],"cases.":[110],"resolve":[112],"this":[116],"by":[118],"giving":[119],"primal-dual":[122],"based":[123],"algorithm.":[125]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}