{"id":"https://openalex.org/W2004321562","doi":"https://doi.org/10.1137/090767108","title":"Strict Cost Sharing Schemes for Steiner Forest","display_name":"Strict Cost Sharing Schemes for Steiner Forest","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2004321562","doi":"https://doi.org/10.1137/090767108","mag":"2004321562"},"language":"en","primary_location":{"id":"doi:10.1137/090767108","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090767108","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ir.cwi.nl/pub/16993","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045233402","display_name":"Lisa Fleischer","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lisa Fleischer","raw_affiliation_strings":["lkf@cs.dartmouth.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"lkf@cs.dartmouth.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111545821","display_name":"Jochen K\u00f6nemann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jochen K\u00f6nemann","raw_affiliation_strings":["jochen@uwaterloo.ca#TAB#"],"affiliations":[{"raw_affiliation_string":"jochen@uwaterloo.ca#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102836759","display_name":"Stefano Leonardi","orcid":"https://orcid.org/0000-0002-9809-7191"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stefano Leonardi","raw_affiliation_strings":["leon@dis.uniroma1.it#TAB#"],"affiliations":[{"raw_affiliation_string":"leon@dis.uniroma1.it#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067080233","display_name":"Guido Sch\u00e4fer","orcid":"https://orcid.org/0000-0002-1923-4902"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guido Sch\u00e4fer","raw_affiliation_strings":["g.schaefer@cwi.nl#TAB#"],"affiliations":[{"raw_affiliation_string":"g.schaefer@cwi.nl#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5045233402"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3417,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.60702793,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"39","issue":"8","first_page":"3616","last_page":"3632"},"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.9997000098228455,"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.9997000098228455,"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.996399998664856,"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"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9290528297424316},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.811879575252533},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5566514134407043},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5419102907180786},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5084878206253052},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.491283118724823},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.4735357463359833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44625574350357056},{"id":"https://openalex.org/keywords/stochastic-optimization","display_name":"Stochastic optimization","score":0.4413830637931824},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.14211636781692505},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.07662302255630493}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9290528297424316},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.811879575252533},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5566514134407043},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5419102907180786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5084878206253052},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.491283118724823},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.4735357463359833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44625574350357056},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.4413830637931824},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.14211636781692505},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.07662302255630493},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/090767108","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090767108","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:cwi:oai:cwi.nl:16993","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/16993","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 39(8), 3616 - 3632","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.395.7911","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.7911","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://homepages.cwi.nl/~schaefer/ftp/pdf/mrob-sicomp.pdf","raw_type":"text"},{"id":"pmh:oai:iris.uniroma1.it:11573/376449","is_oa":false,"landing_page_url":"http://www.scopus.com/inward/record.url?eid=2-s2.0-78751499887&partnerID=65&md5=99c8454e256a003774b2e5a6e01fc249","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:cwi:oai:cwi.nl:16993","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/16993","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 39(8), 3616 - 3632","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"score":0.6399999856948853,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2001139415","https://openalex.org/W2011823863","https://openalex.org/W2057974767","https://openalex.org/W2070664846","https://openalex.org/W2075163336","https://openalex.org/W2096881311","https://openalex.org/W2112058494","https://openalex.org/W2140844111","https://openalex.org/W2624136382"],"related_works":["https://openalex.org/W2883632972","https://openalex.org/W2063761894","https://openalex.org/W2120447465","https://openalex.org/W1588547096","https://openalex.org/W1954856029","https://openalex.org/W2081831441","https://openalex.org/W84305015","https://openalex.org/W36135937","https://openalex.org/W2004321562","https://openalex.org/W2008298964"],"abstract_inverted_index":{"Gupta":[0],"et":[1],"al.":[2],"[J.":[3],"ACM,":[4,24],"54":[5],"(2007),":[6],"article":[7],"11]":[8],"and":[9,12,116,131,140,151,206],"Gupta,":[10],"Kumar,":[11],"Roughgarden":[13],"[in":[14],"Proceedings":[15],"of":[16,22,38,51,84,90,99,149,185],"the":[17,36,59,82,88,106,128,132,144,168,174,183,197,203,211,217],"ACM":[18],"Symposium":[19],"on":[20],"Theory":[21],"Computing,":[23],"New":[25],"York,":[26],"2003,":[27],"pp.":[28],"365\u2013372]":[29],"recently":[30],"developed":[31],"an":[32,55],"elegant":[33],"framework":[34,53,170],"for":[35,42,58,127,196,210],"development":[37,83],"randomized":[39],"approximation":[40,56,85,125,137,147,159,180],"algorithms":[41,86,126],"rent-or-buy":[43,130,134],"network":[44,61],"design":[45,62],"problems.":[46],"The":[47,96],"essential":[48],"building":[49],"block":[50],"this":[52,100],"is":[54,102],"algorithm":[57,195,209],"underlying":[60],"problem":[63,109,201,215],"that":[64,105,113,157],"admits":[65,110],"a":[66,119,193,207],"strict":[67],"cost":[68,72,111],"sharing":[69,73],"scheme.":[70],"Such":[71],"schemes":[74],"have":[75],"also":[76,155],"proven":[77],"to":[78,103,192],"be":[79,165],"useful":[80],"in":[81,87,171,202,216],"context":[89,184],"two-stage":[91,186],"stochastic":[92,187,198,212],"optimization":[93],"with":[94,136,173],"recourse.":[95],"main":[97],"contribution":[98],"paper":[101],"show":[104,156],"Steiner":[107,178,199,213],"forest":[108,179,214],"shares":[112],"are":[114],"3-strict":[115],"4-group-strict.":[117],"As":[118],"consequence,":[120],"we":[121],"derive":[122],"surprisingly":[123],"simple":[124],"multicommodity":[129],"multicast":[133],"problems":[135],"ratios":[138,148],"5":[139],"6,":[141],"improving":[142],"over":[143],"previous":[145],"best":[146,176],"6.828":[150],"12.8,":[152],"respectively.":[153],"We":[154],"no":[158],"ratio":[160],"better":[161],"than":[162],"4.67":[163],"can":[164],"achieved":[166],"using":[167],"sample-and-augment":[169],"combination":[172],"currently":[175],"known":[177],"algorithms.":[181],"In":[182],"optimization,":[188],"our":[189],"result":[190],"leads":[191],"6-approximation":[194],"tree":[200],"black-box":[204],"model":[205],"5-approximation":[208],"independent":[218],"decision":[219],"model.":[220]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}