{"id":"https://openalex.org/W2069417991","doi":"https://doi.org/10.1145/1132516.1132617","title":"A quasi-PTAS for unsplittable flow on line graphs","display_name":"A quasi-PTAS for unsplittable flow on line graphs","publication_year":2006,"publication_date":"2006-05-21","ids":{"openalex":"https://openalex.org/W2069417991","doi":"https://doi.org/10.1145/1132516.1132617","mag":"2069417991"},"language":"en","primary_location":{"id":"doi:10.1145/1132516.1132617","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1132516.1132617","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-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/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["IBM T. J. Watson Research Center, Yorktown Heights, NY","IBM -- T. J. Watson Research Center, Yorktown Heights, NY"],"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research Center, Yorktown Heights, NY","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM -- T. J. Watson Research Center, Yorktown Heights, NY","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084208266","display_name":"Amit Chakrabarti","orcid":"https://orcid.org/0000-0003-3633-9180"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amit Chakrabarti","raw_affiliation_strings":["Dartmouth College, Hanover, NH"],"affiliations":[{"raw_affiliation_string":"Dartmouth College, Hanover, NH","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057109268","display_name":"Amir Epstein","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amir Epstein","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Baruch Schieber","raw_affiliation_strings":["IBM T. J. Watson Research Center, Yorktown Heights, NY","IBM -- T. J. Watson Research Center, Yorktown Heights, NY"],"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research Center, Yorktown Heights, NY","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"IBM -- T. J. Watson Research Center, Yorktown Heights, NY","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I4210114115"],"apc_list":null,"apc_paid":null,"fwci":4.0444,"has_fulltext":false,"cited_by_count":90,"citation_normalized_percentile":{"value":0.93858059,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"721","last_page":"729"},"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.9998000264167786,"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.9998000264167786,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.808870255947113},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.7196112871170044},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6271697282791138},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5946535468101501},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5516001582145691},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5421742796897888},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5143347978591919},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5111387372016907},{"id":"https://openalex.org/keywords/apx","display_name":"APX","score":0.486959308385849},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.4790438413619995},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.45264649391174316},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4374963045120239},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4372689127922058},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3926970362663269},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3225380778312683},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.2435285747051239},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17617827653884888},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.1044614315032959},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09557151794433594},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08658751845359802},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06706488132476807}],"concepts":[{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.808870255947113},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.7196112871170044},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6271697282791138},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5946535468101501},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5516001582145691},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5421742796897888},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5143347978591919},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5111387372016907},{"id":"https://openalex.org/C130698151","wikidata":"https://www.wikidata.org/wiki/Q4653447","display_name":"APX","level":4,"score":0.486959308385849},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.4790438413619995},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.45264649391174316},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4374963045120239},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4372689127922058},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3926970362663269},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3225380778312683},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.2435285747051239},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17617827653884888},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.1044614315032959},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09557151794433594},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08658751845359802},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06706488132476807},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0},{"id":"https://openalex.org/C181199279","wikidata":"https://www.wikidata.org/wiki/Q8047","display_name":"Enzyme","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C46141821","wikidata":"https://www.wikidata.org/wiki/Q209402","display_name":"Nuclear magnetic resonance","level":1,"score":0.0},{"id":"https://openalex.org/C162008176","wikidata":"https://www.wikidata.org/wiki/Q419305","display_name":"Peroxidase","level":3,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1132516.1132617","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1132516.1132617","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/27e1bdb1-6770-4298-9d36-5fc32ca1ddae","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/27e1bdb1-6770-4298-9d36-5fc32ca1ddae","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Chakrabarti, A, Epstein, A & Schieber, B 2006, A quasi-PTAS for unsplittable flow on line graphs. in Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC'06, Seattle WA, USA, May 21-23, 2006). Association for Computing Machinery, Inc., New York, pp. 721-729. https://doi.org/10.1145/1132516.1132617","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:694828","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=694828","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":""},{"id":"pmh:oai:library.tue.nl:694828","is_oa":false,"landing_page_url":"http://repository.tue.nl/694828","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/27e1bdb1-6770-4298-9d36-5fc32ca1ddae","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/27e1bdb1-6770-4298-9d36-5fc32ca1ddae","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC'06, Seattle WA, USA, May 21-23, 2006), 721 - 729","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1559202792","https://openalex.org/W1589172288","https://openalex.org/W1591562949","https://openalex.org/W1608651920","https://openalex.org/W1974115975","https://openalex.org/W1975442866","https://openalex.org/W1989234747","https://openalex.org/W2003902046","https://openalex.org/W2005186378","https://openalex.org/W2014023522","https://openalex.org/W2019062750","https://openalex.org/W2034269606","https://openalex.org/W2049033541","https://openalex.org/W2052476895","https://openalex.org/W2058821164","https://openalex.org/W2061040942","https://openalex.org/W2079300367","https://openalex.org/W2104685111","https://openalex.org/W2135424293","https://openalex.org/W2154571828","https://openalex.org/W2401610261","https://openalex.org/W2569646339","https://openalex.org/W6635323731","https://openalex.org/W6665106537"],"related_works":["https://openalex.org/W1702487489","https://openalex.org/W2086025566","https://openalex.org/W2122455640","https://openalex.org/W2765725004","https://openalex.org/W2962917430","https://openalex.org/W2088158977","https://openalex.org/W2028468530","https://openalex.org/W2086059606","https://openalex.org/W1584635930","https://openalex.org/W4299801389"],"abstract_inverted_index":{"We":[0,24,63],"study":[1],"the":[2,14,20,60,81],"Unsplittable":[3],"Flow":[4],"Problem":[5],"(UFP)":[6],"on":[7,13,34,53,72,108],"line":[8,35],"graphs":[9],"and":[10,57,93],"cycles,":[11],"focusing":[12],"long-standing":[15],"open":[16],"question":[17],"of":[18],"whether":[19],"problem":[21,74],"is":[22],"APX-hard.":[23],"describe":[25],"a":[26,50,76,94,115],"deterministic":[27],"quasi-polynomial":[28,51],"time":[29,78],"approximation":[30],"scheme":[31],"for":[32],"UFP":[33],"graphs,":[36],"thereby":[37],"ruling":[38],"out":[39],"an":[40],"APX-hardness":[41],"result,":[42],"unless":[43],"NP":[44],"\u2286":[45],"DTIME(2polylog(n)).":[46],"Our":[47],"result":[48,66],"requires":[49],"bound":[52],"all":[54],"edge":[55,88],"capacities":[56],"demands":[58],"in":[59],"input":[61],"instance.":[62],"extend":[64],"this":[65,73,99],"to":[67],"undirected":[68],"cycle":[69],"graphs.Earlier":[70],"results":[71,111],"included":[75],"polynomial":[77],"(2+\u03b5)-approximation":[79],"under":[80],"assumption":[82,100],"that":[83],"no":[84],"demand":[85],"exceeds":[86],"any":[87],"capacity":[89],"(the":[90],"\"no-bottleneck":[91],"assumption\")":[92],"super-constant":[95],"integrality":[96],"gap":[97],"if":[98],"did":[101],"not":[102,113],"hold.":[103],"Unlike":[104],"most":[105],"earlier":[106],"work":[107],"UFP,":[109],"our":[110],"do":[112],"require":[114],"no-bottleneck":[116],"assumption.":[117]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}