{"id":"https://openalex.org/W2264382075","doi":"https://doi.org/10.1007/978-3-662-48995-6_7","title":"New Complexity Results and Algorithms for the Minimum Tollbooth Problem","display_name":"New Complexity Results and Algorithms for the Minimum Tollbooth Problem","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2264382075","doi":"https://doi.org/10.1007/978-3-662-48995-6_7","mag":"2264382075"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-48995-6_7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-662-48995-6_7","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1007/978-3-662-48995-6_7","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021984566","display_name":"Soumya Basu","orcid":"https://orcid.org/0000-0001-5486-2448"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Soumya Basu","raw_affiliation_strings":["University of Texas at Austin, Austin, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081225965","display_name":"Thanasis Lianeas","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thanasis Lianeas","raw_affiliation_strings":["University of Texas at Austin, Austin, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013808874","display_name":"Evdokia Nikolova","orcid":"https://orcid.org/0000-0002-8801-0320"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Evdokia Nikolova","raw_affiliation_strings":["University of Texas at Austin, Austin, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5021984566"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":2.926,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.89774601,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"89","last_page":"103"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9904999732971191,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6352445483207703},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.5694701671600342},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.560973584651947},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5449258089065552},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5372498035430908},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5355287790298462},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5161455869674683},{"id":"https://openalex.org/keywords/inefficiency","display_name":"Inefficiency","score":0.49238693714141846},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4775208532810211},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.457893431186676},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4522460401058197},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.43809932470321655},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.4286126494407654},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3402494490146637},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29877543449401855},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18691283464431763}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6352445483207703},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5694701671600342},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.560973584651947},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5449258089065552},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5372498035430908},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5355287790298462},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5161455869674683},{"id":"https://openalex.org/C2778869765","wikidata":"https://www.wikidata.org/wiki/Q6028363","display_name":"Inefficiency","level":2,"score":0.49238693714141846},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4775208532810211},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.457893431186676},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4522460401058197},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.43809932470321655},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.4286126494407654},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3402494490146637},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29877543449401855},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18691283464431763},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-662-48995-6_7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-662-48995-6_7","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-3-662-48995-6_7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-662-48995-6_7","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1533126627","https://openalex.org/W1560572774","https://openalex.org/W1565111024","https://openalex.org/W1979964121","https://openalex.org/W1982862187","https://openalex.org/W2025838844","https://openalex.org/W2034637361","https://openalex.org/W2059109315","https://openalex.org/W2074699430","https://openalex.org/W2082848291","https://openalex.org/W2097568888","https://openalex.org/W2143698439","https://openalex.org/W2175706438","https://openalex.org/W2177295793","https://openalex.org/W2264382075","https://openalex.org/W2797415156","https://openalex.org/W2912507046","https://openalex.org/W4297563113"],"related_works":["https://openalex.org/W3161514703","https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W2098682899","https://openalex.org/W4206915070","https://openalex.org/W2080904092","https://openalex.org/W2531764854","https://openalex.org/W2051329268","https://openalex.org/W1994440468","https://openalex.org/W3006069386"],"abstract_inverted_index":{"The":[0],"inefficiency":[1],"of":[2,6,19,40,53,98,120,182,197],"the":[3,17,24,37,63,89,104,121,137,160,164,169,175,192,198],"Wardrop":[4],"equilibrium":[5,32],"nonatomic":[7],"routing":[8],"games":[9],"can":[10],"be":[11,45],"eliminated":[12],"by":[13,136,189],"placing":[14,127],"tolls":[15,75],"on":[16],"edges":[18,41,135],"a":[20,96,101,117,157],"network":[21,111,200],"so":[22],"that":[23,88,142],"socially":[25],"optimal":[26],"flow":[27],"is":[28,91,130],"induced":[29],"as":[30],"an":[31,179],"flow.":[33],"A":[34],"solution":[35,173],"where":[36],"minimum":[38,64,77,105],"number":[39],"are":[42],"tolled":[43],"may":[44],"preferable":[46],"over":[47],"others":[48],"due":[49],"to":[50,93,115,126,132,174],"its":[51],"ease":[52],"implementation":[54],"in":[55,124,178],"real":[56],"networks.":[57],"In":[58],"this":[59,143],"paper":[60],"we":[61,167],"consider":[62],"tollbooth":[65],"(":[66],"$${MINTB}$$":[67,176,188],")":[68],"problem,":[69],"which":[70],"seeks":[71],"social":[72,138],"optimum":[73],"inducing":[74],"with":[76,85,153],"support.":[78],"We":[79,140],"prove":[80,141],"for":[81,149,195],"single":[82,150],"commodity":[83,151],"networks":[84,152],"linear":[86,154],"latencies":[87],"problem":[90,122,145,177],"NP-hard":[92,147],"approximate":[94],"within":[95],"factor":[97],"1.1377":[99],"through":[100],"reduction":[102,158],"from":[103,110,159],"vertex":[106],"cover":[107],"problem.":[108,162],"Insights":[109],"design":[112],"motivate":[113],"us":[114],"formulate":[116],"new":[118,144],"variation":[119],"where,":[123],"addition":[125],"tolls,":[128],"it":[129],"allowed":[131],"remove":[133],"unused":[134],"optimum.":[139],"remains":[146],"even":[148],"latencies,":[155],"using":[156],"partition":[161],"On":[163],"positive":[165],"side,":[166],"give":[168],"first":[170,190],"exact":[171],"polynomial":[172],"important":[180],"class":[181],"graphs\u2014series-parallel":[183],"graphs.":[184],"Our":[185],"algorithm":[186],"solves":[187],"tabulating":[191],"candidate":[193],"solutions":[194],"subgraphs":[196],"series-parallel":[199],"and":[201],"then":[202],"combining":[203],"them":[204],"optimally.":[205]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}