{"id":"https://openalex.org/W159403033","doi":"https://doi.org/10.1007/s00453-010-9480-3","title":"Stackelberg Network Pricing Games","display_name":"Stackelberg Network Pricing Games","publication_year":2010,"publication_date":"2010-12-03","ids":{"openalex":"https://openalex.org/W159403033","doi":"https://doi.org/10.1007/s00453-010-9480-3","mag":"159403033"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-010-9480-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-010-9480-3","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0802.2841","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079296217","display_name":"Patrick Briest","orcid":null},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Patrick Briest","raw_affiliation_strings":["Department of Computer Science, University of Paderborn, Paderborn, Germany","University of Paderborn, Department of Computer Science, Paderborn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Paderborn, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]},{"raw_affiliation_string":"University of Paderborn, Department of Computer Science, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065332233","display_name":"Martin Hoefer","orcid":"https://orcid.org/0000-0003-0131-5605"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Hoefer","raw_affiliation_strings":["Department of Computer Science, RWTH Aachen University, Aachen, Germany","[RWTH Aachen University, Department of Computer Science, Aachen, Germany]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"[RWTH Aachen University, Department of Computer Science, Aachen, Germany]","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079362010","display_name":"Piotr Krysta","orcid":"https://orcid.org/0000-0002-1498-9994"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Piotr Krysta","raw_affiliation_strings":["Department of Computer Science, The University of Liverpool, Liverpool, UK","The University of Liverpool,Department of Computer Science,Liverpool,UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Liverpool, Liverpool, UK","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"The University of Liverpool,Department of Computer Science,Liverpool,UK","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065332233"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.8106,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.78481304,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"62","issue":"3-4","first_page":"733","last_page":"753"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9866999983787537,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9866999983787537,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9803000092506409,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9739000201225281,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/stackelberg-competition","display_name":"Stackelberg competition","score":0.8468015193939209},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6084370613098145},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5602700114250183},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.51080322265625},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4863048493862152},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4630124568939209},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4224320650100708},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.4190674126148224},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30735212564468384}],"concepts":[{"id":"https://openalex.org/C199510392","wikidata":"https://www.wikidata.org/wiki/Q1184602","display_name":"Stackelberg competition","level":2,"score":0.8468015193939209},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6084370613098145},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5602700114250183},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.51080322265625},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4863048493862152},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4630124568939209},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4224320650100708},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.4190674126148224},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30735212564468384}],"mesh":[],"locations_count":17,"locations":[{"id":"doi:10.1007/s00453-010-9480-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-010-9480-3","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:1340","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1340","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:arXiv.org:0802.2841","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0802.2841","pdf_url":"https://arxiv.org/pdf/0802.2841","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2952053120","is_oa":true,"landing_page_url":"https://hal.science/hal-00220519","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"HAL (Le Centre pour la Communication Scientifique Directe)","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.710","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.710","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0802.2841.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.141.6419","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.6419","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/eccc-reports/2007/TR07-101/revisn01.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.165.613","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://drops.dagstuhl.de/opus/volltexte/2008/1340/pdf/22011.BriestPatrick.Paper.1340.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.167.9465","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.9465","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-i1.informatik.rwth-aachen.de/en/%7Emhoefer/Forschung/08-0x/Briest10Stack.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.205.3553","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.3553","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2007/101/download/","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.217.7717","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.7717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.inf.uni-konstanz.de/cgip/bib/files/BrHoKr08.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.66.9371","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.9371","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csc.liv.ac.uk/research/techreports/tr2007/ulcs-07-022.pdf","raw_type":"text"},{"id":"pmh:oai:publications.rwth-aachen.de:131852","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/131852","pdf_url":null,"source":{"id":"https://openalex.org/S4306401033","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica 62(3/4), 733-753 (2012). doi:10.1007/s00453-010-9480-3","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:publications.rwth-aachen.de:99023","is_oa":true,"landing_page_url":"https://publications.rwth-aachen.de/record/99023","pdf_url":null,"source":{"id":"https://openalex.org/S4306401033","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"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":"Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science : Bordeaux, France, February 21-23, 2008 / Susanne Albers, Pascal Weil (Eds.)<br/>25. Annual Symposium on the Theoretical Aspects of Computer Science, STACS 2008, Bordeaux, France, 2008-02-21 - 2008-02-23","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"doi:10.48550/arxiv.0802.2841","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.0802.2841","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.4230/lipics.stacs.2008.1340","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.stacs.2008.1340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"mag:159403033","is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/eccc-reports/2007/TR07-101/index.html","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null},{"id":"mag:2243826197","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/stacs/stacs2008.html#BriestHK08","pdf_url":null,"source":{"id":"https://openalex.org/S4306421002","display_name":"Symposium on Theoretical Aspects of Computer Science","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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Symposium on Theoretical Aspects of Computer Science","raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0802.2841","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0802.2841","pdf_url":"https://arxiv.org/pdf/0802.2841","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2010916800","https://openalex.org/W2029456721","https://openalex.org/W2039786295","https://openalex.org/W2096303084","https://openalex.org/W2102545534","https://openalex.org/W2111240209","https://openalex.org/W2129592590","https://openalex.org/W2951951756","https://openalex.org/W6999219447"],"related_works":["https://openalex.org/W2243826197","https://openalex.org/W194519915","https://openalex.org/W2126019099","https://openalex.org/W1964483006","https://openalex.org/W1978032288","https://openalex.org/W2075327440","https://openalex.org/W3124438019","https://openalex.org/W2124652308","https://openalex.org/W3123012283","https://openalex.org/W2989745944","https://openalex.org/W2071713714","https://openalex.org/W2137967811","https://openalex.org/W2035069154","https://openalex.org/W3182197126","https://openalex.org/W2182203805","https://openalex.org/W1538386605","https://openalex.org/W2400640684","https://openalex.org/W2430088022","https://openalex.org/W2807284972","https://openalex.org/W2768332442"],"abstract_inverted_index":{"We":[0],"study":[1],"a":[2,13,19,26,32,45,53,122,126,136,145,201],"multi-player":[3],"one-round":[4],"game":[5],"termed":[6],"Stackelberg":[7,104,213],"Network":[8],"Pricing":[9],"Game,":[10],"in":[11,25,86,208],"which":[12,134,216],"leader":[14,70],"can":[15,140,227],"set":[16],"prices":[17,78],"for":[18,83,106,129,149,170,193,205,234],"subset":[20],"of":[21,77,125,212,238],"m":[22],"priceable":[23,84],"edges":[24,30,85],"graph.":[27],"The":[28,69,156],"other":[29],"have":[31,175],"fixed":[33,63],"cost.":[34],"Based":[35],"on":[36,61,219],"the":[37,62,66,74,81,130,150,177,185,209],"leader\u2019s":[38,67],"decision":[39],"one":[40],"or":[41,113],"more":[42],"followers":[43,82,174],"optimize":[44],"polynomial-time":[46],"solvable":[47],"combinatorial":[48],"minimization":[49],"problem":[50,152,157,186],"and":[51,65,98,153,184,222],"choose":[52],"minimum":[54,114],"cost":[55],"solution":[56],"satisfying":[57],"their":[58,87],"requirements":[59],"based":[60,218],"costs":[64],"prices.":[68],"receives":[71],"as":[72,101,103],"revenue":[73,206],"total":[75],"amount":[76],"paid":[79],"by":[80],"solutions.":[88],"Our":[89,117,196],"model":[90],"extends":[91],"several":[92],"known":[93],"pricing":[94,105],"problems,":[95],"including":[96],"single-minded":[97],"unit-demand":[99],"pricing,":[100],"well":[102],"certain":[107],"follower":[108,132],"problems":[109],"like":[110],"shortest":[111],"path":[112],"spanning":[115],"tree.":[116],"first":[118],"main":[119,198],"result":[120,199],"is":[121,158,187,200,217],"tight":[123],"analysis":[124],"single-price":[127,178],"algorithm":[128,179,204],"single":[131],"game,":[133],"provides":[135,180],"(1+\u03b5)log":[137],"m-approximation.":[138],"This":[139,225],"be":[141,162,228],"extended":[142,229],"to":[143,161,164,189,230],"provide":[144,231],"(1+\u03b5)(log":[146],"k+log":[147],"m)-approximation":[148],"general":[151],"k":[154],"followers.":[155,239],"also":[159],"shown":[160],"hard":[163,188],"approximate":[165,190],"within":[166,191],"$\\mathcal{O}(\\log^{\\varepsilon}k":[167],"+":[168],"\\log^{\\varepsilon}m)$":[169],"some":[171,194],"\u03b5>0.":[172,195],"If":[173],"demands,":[176],"an":[181],"$\\mathcal{O}(m^{2})$":[182],"-approximation,":[183],"$\\mathcal{O}(m^{\\epsilon})$":[192],"second":[197],"polynomial":[202],"time":[203],"maximization":[207],"special":[210],"case":[211],"bipartite":[214],"vertex-cover,":[215],"non-trivial":[220],"max-flow":[221],"LP-duality":[223],"techniques.":[224],"approach":[226],"constant-factor":[232],"approximations":[233],"any":[235],"constant":[236],"number":[237]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}