{"id":"https://openalex.org/W2849473708","doi":"https://doi.org/10.1137/15m102695x","title":"Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems","display_name":"Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2849473708","doi":"https://doi.org/10.1137/15m102695x","mag":"2849473708"},"language":"en","primary_location":{"id":"doi:10.1137/15m102695x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m102695x","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076091318","display_name":"Mohammad Hossein Bateni","orcid":"https://orcid.org/0000-0002-8060-6488"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohammad Hossein Bateni","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114053165","display_name":"Mohammad Taghi Hajiaghayi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mohammad Taghi Hajiaghayi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055811592","display_name":"Vahid Liaghat","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vahid Liaghat","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0302,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.78941719,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"47","issue":"4","first_page":"1275","last_page":"1293"},"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.9976000189781189,"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.9976000189781189,"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/T11182","display_name":"Auction Theory and Applications","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9970999956130981,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9314175844192505},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6213861107826233},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6103634238243103},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5914351940155029},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5659433603286743},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5194137096405029},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5174087285995483},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4717218279838562},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.44845834374427795},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41139650344848633},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39994531869888306},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36238330602645874},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3319021463394165}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9314175844192505},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6213861107826233},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6103634238243103},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5914351940155029},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5659433603286743},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5194137096405029},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5174087285995483},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4717218279838562},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.44845834374427795},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41139650344848633},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39994531869888306},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36238330602645874},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3319021463394165},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/15m102695x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m102695x","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1129333050","display_name":null,"funder_award_id":"N000141110662","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G1808967161","display_name":null,"funder_award_id":"FA9550-12-1-0423","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G373458095","display_name":null,"funder_award_id":"CCF-1161626","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4425768753","display_name":"CAREER: Foundations of Network Design: Real-World Networks, Special Topologies, and Game Theory","funder_award_id":"1053605","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"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"},{"id":"https://openalex.org/F4320310578","display_name":"University of Maryland","ror":"https://ror.org/01r0c1p88"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1963899113","https://openalex.org/W1967641001","https://openalex.org/W2001139415","https://openalex.org/W2123442845","https://openalex.org/W2139841919","https://openalex.org/W2147258429","https://openalex.org/W2767048380"],"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/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W2404561224"],"abstract_inverted_index":{"Moss":[0,195,221,270],"and":[1,20,196,222,239,271],"Rabani":[2,197,272],"study":[3],"constrained":[4],"node-weighted":[5,32,75,139,208],"Steiner":[6,34,76,141,209],"tree":[7,35,47,77,88,210],"problems":[8],"with":[9,15,89,177],"two":[10,122],"independent":[11],"weight":[12],"values":[13],"associated":[14],"each":[16,149],"node,":[17],"namely,":[18],"cost":[19,44,99],"prize":[21,85],"(or":[22],"penalty).":[23],"They":[24,58],"give":[25],"an":[26,215,231,241,298],"$O(\\log":[27,131,242],"n)$-approximation":[28,234,243],"algorithm":[29,61,71,133,159,166,191,244,299],"for":[30,62,72,93,134,198,205,282,290,307,318],"the":[31,38,43,49,56,60,73,79,84,103,112,151,169,206,218,225,250,261,266,274,305,308,319,330],"prize-collecting":[33,140],"problem":[36],"(PCST)---where":[37],"goal":[39,80],"is":[40,81,128,204,213,315],"to":[41,64,82,101,187,217,258,273],"minimize":[42],"of":[45,51,86,111,153,156,171,184,194,220,269,278],"a":[46,66,87,90,107,129,135,154,164,175,188,254,301],"plus":[48],"penalty":[50],"vertices":[52],"not":[53],"covered":[54],"by":[55,173,235,324],"tree.":[57],"use":[59],"PCST":[63],"obtain":[65],"bicriteria":[67,267,275],"$(2,":[68],"O(\\log":[69,280],"n))$-approximation":[70],"budgeted":[74,207],"problem---where":[78],"maximize":[83],"given":[91],"budget":[92,247,293],"its":[94],"cost.":[95],"Their":[96],"solution":[97,262],"may":[98],"up":[100],"twice":[102],"budget,":[104],"but":[105],"collects":[106],"factor":[108],"$\\Omega(\\frac{1}{\\log":[109],"n})$":[110],"optimal":[113],"prize.":[114,309],"We":[115],"improve":[116,229,265],"these":[117],"results":[118],"from":[119],"at":[120],"least":[121],"aspects.":[123],"Our":[124,158,200],"first":[125],"main":[126,202],"result":[127,268],"primal-dual":[130],"h)$-approximation":[132],"more":[136],"general":[137],"problem,":[138,211],"forest":[142],"(PCSF),":[143],"where":[144,253],"we":[145,228,264,296,311],"have":[146],"$h$":[147],"demands":[148,172],"requesting":[150],"connectivity":[152],"pair":[155],"vertices.":[157],"can":[160],"be":[161],"seen":[162],"as":[163,326,328],"greedy":[165],"which":[167,212],"reduces":[168],"number":[170],"choosing":[174],"structure":[176],"minimum":[178],"cost-to-reduction":[179],"ratio.":[180],"This":[181],"natural":[182,320],"style":[183],"argument":[185],"leads":[186],"much":[189],"simpler":[190],"than":[192],"that":[193,313],"PCST.":[199],"second":[201],"contribution":[203],"also":[214],"improvement":[216],"work":[219],"Rabani.":[223],"In":[224],"unrooted":[226],"case,":[227,252],"upon":[230],"existing":[232],"$O(\\log^2":[233],"Guha":[236],"et":[237],"al.,":[238],"present":[240,297],"without":[245],"any":[246,283,291],"violation.":[248],"For":[249],"rooted":[251],"specified":[255],"vertex":[256],"has":[257],"appear":[259],"in":[260,304,329],"tree,":[263],"approximation":[276],"ratio":[277],"$(1+\\epsilon,":[279],"n)/\\epsilon^2)$":[281],"positive":[284],"(possibly":[285],"subconstant)":[286],"$\\epsilon$.":[287],"That":[288],"is,":[289],"permissible":[292],"violation":[294],"$1+\\epsilon$,":[295],"achieving":[300],"trade":[302],"off":[303],"guarantee":[306],"Indeed,":[310],"show":[312],"this":[314],"almost":[316],"tight":[317],"linear-programming":[321],"relaxation":[322],"used":[323],"us":[325],"well":[327],"previous":[331],"works.":[332]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}