{"id":"https://openalex.org/W2126874118","doi":"https://doi.org/10.1145/2532645","title":"A logarithmic approximation for unsplittable flow on line graphs","display_name":"A logarithmic approximation for unsplittable flow on line graphs","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2126874118","doi":"https://doi.org/10.1145/2532645","mag":"2126874118"},"language":"en","primary_location":{"id":"doi:10.1145/2532645","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2532645","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I4210106712","display_name":"Alliance for Safe Kids","ror":"https://ror.org/01922pt58","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210106712"]},{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL","US"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Eindhoven University of Technology, Yorktown Heights, NY","Eindhoven University of Technology, Yorktown Heights, NY#TAB#"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Yorktown Heights, NY","institution_ids":["https://openalex.org/I4210106712"]},{"raw_affiliation_string":"Eindhoven University of Technology, Yorktown Heights, NY#TAB#","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020188279","display_name":"Zachary Friggstad","orcid":"https://orcid.org/0000-0003-4039-3235"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Zachary Friggstad","raw_affiliation_strings":["University of Waterloo, Alberta, Canada","University of Waterloo, Alberta, Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Waterloo, Alberta, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"University of Waterloo, Alberta, Canada#TAB#","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074837451","display_name":"Rohit Khandekar","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rohit Khandekar","raw_affiliation_strings":["IBM T. J. Watson Research Center, Jersey city, NJ, USA","IBM T. J. Watson Research Center, Jersey city, NJ, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research Center, Jersey city, NJ, USA","institution_ids":["https://openalex.org/I1341412227"]},{"raw_affiliation_string":"IBM T. J. Watson Research Center, Jersey city, NJ, USA#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010339836","display_name":"Mohammad R. Salavatipour","orcid":"https://orcid.org/0000-0002-7650-2045"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mohammad R. Salavatipour","raw_affiliation_strings":["University of Alberta, Edmonton, Alberta, Canada","University of Alberta, Edmonton, Alberta., Canada"],"affiliations":[{"raw_affiliation_string":"University of Alberta, Edmonton, Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"University of Alberta, Edmonton, Alberta., Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I4210106712","https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":1.4767,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.83441688,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"10","issue":"1","first_page":"1","last_page":"15"},"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.9993000030517578,"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.9993000030517578,"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.9991000294685364,"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.9965999722480774,"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/rounding","display_name":"Rounding","score":0.7784067392349243},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6790378093719482},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6267586350440979},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.57603919506073},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5746161937713623},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5434756875038147},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5171636939048767},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5129215717315674},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4964345097541809},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4744088351726532},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.46211105585098267},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.45115625858306885},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3727703094482422},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3131142854690552}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7784067392349243},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6790378093719482},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6267586350440979},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.57603919506073},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5746161937713623},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5434756875038147},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5171636939048767},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5129215717315674},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4964345097541809},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4744088351726532},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.46211105585098267},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.45115625858306885},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3727703094482422},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3131142854690552},{"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/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2532645","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2532645","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/fcfdb103-a382-4140-b46b-51dbdf913611","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/fcfdb103-a382-4140-b46b-51dbdf913611","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, Friggstad, Z, Khandekar, R & Salavatipour, M R 2014, 'A logarithmic approximation for unsplittable flow on line graphs', ACM Transactions on Algorithms, vol. 10, no. 1, pp. 1-1/15. https://doi.org/10.1145/2532645","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/df294d86-b30d-4b3d-9425-ceca5acee215","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/df294d86-b30d-4b3d-9425-ceca5acee215","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bansal, N, Friggstad, Z, Khandekar, R & Salavatipour, M R 2009, A logarithmic approximation for unsplittable flow on line graphs. in C Mathieu (ed.), Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09, New York NY, USA, January 4-6, 2009). Association for Computing Machinery, Inc., New York, pp. 702-709.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/df294d86-b30d-4b3d-9425-ceca5acee215","is_oa":false,"landing_page_url":"http://doi.acm.org/10.1145/1496770.1496847","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bansal, N, Friggstad, Z, Khandekar, R & Salavatipour, M R 2009, A logarithmic approximation for unsplittable flow on line graphs. in C Mathieu (ed.), Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09, New York NY, USA, January 4-6, 2009). Association for Computing Machinery, Inc., New York, pp. 702-709.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/fcfdb103-a382-4140-b46b-51dbdf913611","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/fcfdb103-a382-4140-b46b-51dbdf913611","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":"ACM Transactions on Algorithms, 10(1), 1 - 1/15. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"},{"id":"https://openalex.org/F4320334960","display_name":"Seventh Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1559202792","https://openalex.org/W1591562949","https://openalex.org/W1974115975","https://openalex.org/W1996971123","https://openalex.org/W2003902046","https://openalex.org/W2014023522","https://openalex.org/W2015232621","https://openalex.org/W2019062750","https://openalex.org/W2026891055","https://openalex.org/W2034269606","https://openalex.org/W2058091369","https://openalex.org/W2069417991","https://openalex.org/W2103363383","https://openalex.org/W2108031738","https://openalex.org/W2108736261","https://openalex.org/W2127719709","https://openalex.org/W2129239025","https://openalex.org/W2135424293","https://openalex.org/W2140262267","https://openalex.org/W2154571828","https://openalex.org/W2170344325","https://openalex.org/W2178644091","https://openalex.org/W2569646339","https://openalex.org/W2611804663","https://openalex.org/W4300550233","https://openalex.org/W4389615622","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W4388481423","https://openalex.org/W2543175834","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W2039086323","https://openalex.org/W2096589954","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W2076740206"],"abstract_inverted_index":{"We":[0,106],"consider":[1],"the":[2,82,89,103,108,124,127,156,159,174,198,224,250,260],"unsplittable":[3],"flow":[4],"problem":[5,145,251],"on":[6,197,210],"a":[7,15,23,35,42,67,94,211,218],"line.":[8],"In":[9],"this":[10,119,144,237],"problem,":[11],"we":[12,78],"are":[13,79,187,257],"given":[14],"set":[16],"of":[17,56,69,96,126,176,213,249],"n":[18,114,135,193,231],"tasks,":[19],"each":[20],"specified":[21,81],"by":[22],"start":[24],"time":[25,31,59,75,111,132],"s":[26,60],"i":[27,33,38,45,54,61,64,71,164,166],",":[28,34,77,87,172],"an":[29,229],"end":[30],"t":[32,63,76,86,169,171],"demand":[36],"d":[37,53,165],">":[39,46],"0,":[40],"and":[41,65,88,182,216],"profit":[43,68,100],"p":[44,70],"0.":[47],"A":[48],"task,":[49],"if":[50],"accepted,":[51],"requires":[52],"units":[55],"\u201cbandwidth\u201d":[57],"from":[58],"to":[62,92,102,179,184,244,252],"accrues":[66],".":[72,194],"For":[73],"every":[74],"also":[80],"available":[83],"bandwidth":[84,104],"c":[85,170],"goal":[90],"is":[91,208,228,243],"find":[93],"subset":[95],"tasks":[97],"with":[98],"maximum":[99,178,183],"subject":[101],"constraints.":[105],"present":[107],"first":[109],"polynomial":[110,131],"O":[112],"(log":[113],")":[115,136,232],"approximation":[116,137],"algorithm":[117,207],"for":[118,143,223,236,259],"problem.":[120,225],"This":[121],"significantly":[122],"advances":[123],"state":[125],"art,":[128],"as":[129],"no":[130],"o":[133],"(":[134],"was":[138],"known":[139,147,235],"previously.":[140],"Previous":[141],"results":[142],"were":[146],"only":[148],"in":[149,153,192,263],"more":[150],"restrictive":[151],"settings;":[152],"particular,":[154],"either":[155],"instance":[157],"satisfies":[158],"so-called":[160],"\u201cno-bottleneck\u201d":[161],"assumption:":[162],"max":[163],"\u2264":[167],"min":[168],"or":[173],"ratio":[175],"both":[177],"minimum":[180,185],"demands":[181],"capacities":[186],"polynomially":[188],"(or":[189],"quasi-polynomially)":[190],"bounded":[191],"Our":[195,206],"result,":[196],"other":[199],"hand,":[200],"does":[201],"not":[202],"require":[203],"these":[204],"assumptions.":[205],"based":[209],"combination":[212],"dynamic":[214,268],"programming":[215,221],"rounding":[217],"natural":[219],"linear":[220],"relaxation":[222],"While":[226],"there":[227],"\u03a9(":[230],"integrality":[233],"gap":[234],"LP":[238,261],"relaxation,":[239],"our":[240],"key":[241],"idea":[242],"exploit":[245],"certain":[246],"structural":[247],"properties":[248],"show":[253],"that":[254,256],"instances":[255],"bad":[258],"can":[262],"fact":[264],"be":[265],"handled":[266],"using":[267],"programming.":[269]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2025-10-10T00:00:00"}