{"id":"https://openalex.org/W7097897895","doi":null,"title":"Approximation via Cost Sharing: Simpler and better . . .","display_name":"Approximation via Cost Sharing: Simpler and better . . .","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7097897895"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.209.107","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.209.107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://metalab.uniten.edu.my/~marina/CSNB524/Assg/cost%20sharing%20ALGO-gupta.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7097897895"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5143131786","display_name":"Anupam Gupta","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5143049476","display_name":"Amit Kumar","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amit Kumar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064235715","display_name":"Martin P\u00e1l","orcid":"https://orcid.org/0000-0002-1563-5426","observed_orcids":["https://orcid.org/0000-0002-1563-5426"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin P\u00e1l","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5022886322","display_name":"Tim Roughgarden","orcid":"https://orcid.org/0000-0002-7163-8306","observed_orcids":["https://orcid.org/0000-0002-7163-8306"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tim Roughgarden","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":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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.9994999766349792,"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.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":9.999999747378752e-05,"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/cost-sharing","display_name":"cost sharing","score":0.7799999713897705},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8659999966621399},{"id":"https://openalex.org/keywords/network-design","display_name":"network design","score":0.8600000143051147},{"id":"https://openalex.org/keywords/np-hard-optimization-problems","display_name":"NP-hard optimization","score":0.746999979019165},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.6050000190734863},{"id":"https://openalex.org/keywords/random-sampling","display_name":"random sampling","score":0.968999981880188}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7023000121116638},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6014999747276306},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.5078999996185303},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4758000075817108},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4747999906539917},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.45989999175071716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4535999894142151},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42739999294281006},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.42089998722076416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3991999924182892},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.35499998927116394},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.3440000116825104},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C32946077","wikidata":"https://www.wikidata.org/wiki/Q618079","display_name":"Network analysis","level":2,"score":0.31769999861717224},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.3156000077724457},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3046000003814697},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.3021000027656555},{"id":"https://openalex.org/C160824197","wikidata":"https://www.wikidata.org/wiki/Q2071054","display_name":"Linear approximation","level":3,"score":0.29100000858306885},{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.2892000079154968},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.27459999918937683},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2743000090122223},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C2993663582","wikidata":"https://www.wikidata.org/wiki/Q5174773","display_name":"Cost structure","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2621000111103058}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.209.107","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.209.107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://metalab.uniten.edu.my/~marina/CSNB524/Assg/cost%20sharing%20ALGO-gupta.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.89.4736","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.4736","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/~tim/papers/simple.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2096881311","https://openalex.org/W6959604424","https://openalex.org/W7095351528","https://openalex.org/W2146763892","https://openalex.org/W2097181193","https://openalex.org/W7099759717","https://openalex.org/W4239031269","https://openalex.org/W7119397734"],"abstract_inverted_index":{"We":[0,46],"present":[1],"constant-factor":[2],"approximation":[3,32,55],"algorithms":[4,27],"for":[5],"several":[6],"widely-studied":[7],"NP-hard":[8],"optimization":[9],"problems":[10],"in":[11,39],"network":[12,20],"design,":[13,21],"including":[14],"the":[15,54],"multicommodity":[16],"rent-or-buy,":[17],"virtual":[18],"private":[19],"and":[22,30,71],"single-sink":[23],"buy-at-bulk":[24],"problems.":[25],"Our":[26],"are":[28],"simple":[29],"their":[31],"ratios":[33,56],"improve":[34],"over":[35],"those":[36],"previously":[37],"known,":[38],"some":[40],"cases":[41],"by":[42],"orders":[43],"of":[44,57],"magnitude.":[45],"develop":[47],"a":[48,65],"general":[49],"analysis":[50],"framework":[51,61],"to":[52],"bound":[53],"our":[58],"algorithms.":[59],"This":[60],"is":[62],"based":[63],"on":[64],"novel":[66],"connection":[67],"between":[68],"random":[69],"sampling":[70],"game-theoretic":[72],"cost":[73]},"counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2025-10-27T00:00:00"}