{"id":"https://openalex.org/W2104685111","doi":"https://doi.org/10.1007/s00453-006-1210-5","title":"Approximation Algorithms for the Unsplittable Flow Problem","display_name":"Approximation Algorithms for the Unsplittable Flow Problem","publication_year":2006,"publication_date":"2006-08-25","ids":{"openalex":"https://openalex.org/W2104685111","doi":"https://doi.org/10.1007/s00453-006-1210-5","mag":"2104685111"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-006-1210-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-006-1210-5","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":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/Approximation_Algorithms_for_the_Unsplittable_Flow_Problem/6603611","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Amit Chakrabarti","raw_affiliation_strings":["Department of Computer Science, Dartmouth\nCollege, Hanover, NH 03755, USA","Department of Computer Science, Dartmouth College, Hanover NH 03755 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Dartmouth\nCollege, Hanover, NH 03755, USA","institution_ids":["https://openalex.org/I107672454"]},{"raw_affiliation_string":"Department of Computer Science, Dartmouth College, Hanover NH 03755 USA","institution_ids":["https://openalex.org/I107672454"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[{"id":"https://openalex.org/I72090969","display_name":"Nokia (United States)","ror":"https://ror.org/038km2573","country_code":"US","type":"company","lineage":["https://openalex.org/I2738502077","https://openalex.org/I72090969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["Lucent Bell Labs, 600 Mountain Ave., Murray Hill, NJ 07974, USA","Lucent Bell Labs, 600 Mountain Ave., Murray Hill, NJ 07974, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lucent Bell Labs, 600 Mountain Ave., Murray Hill, NJ 07974, USA","institution_ids":[]},{"raw_affiliation_string":"Lucent Bell Labs, 600 Mountain Ave., Murray Hill, NJ 07974, USA#TAB#","institution_ids":["https://openalex.org/I72090969"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anupam Gupta","raw_affiliation_strings":["Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA","Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pa. 15213, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pa. 15213, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029407896","display_name":"Amit Kumar","orcid":"https://orcid.org/0000-0002-3965-6627"},"institutions":[{"id":"https://openalex.org/I64295750","display_name":"Indian Institute of Technology Indore","ror":"https://ror.org/01hhf7w52","country_code":"IN","type":"education","lineage":["https://openalex.org/I64295750"]},{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Amit Kumar","raw_affiliation_strings":["Department of Computer Science, Indian Institute of Technology, Hauz Khas, New Delhi, India  110016","Department of Computer Science, Indian Institute of Technology, Hauz Khas, New Delhi, India 110016"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Indian Institute of Technology, Hauz Khas, New Delhi, India  110016","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Department of Computer Science, Indian Institute of Technology, Hauz Khas, New Delhi, India 110016","institution_ids":["https://openalex.org/I64295750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5029407896","https://openalex.org/A5036503505","https://openalex.org/A5078381067","https://openalex.org/A5084208266"],"corresponding_institution_ids":["https://openalex.org/I107672454","https://openalex.org/I64295750","https://openalex.org/I68891433","https://openalex.org/I72090969","https://openalex.org/I74973139"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":4.2001,"has_fulltext":false,"cited_by_count":114,"citation_normalized_percentile":{"value":0.94423499,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"47","issue":"1","first_page":"53","last_page":"78"},"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.9998999834060669,"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.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7667478322982788},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7167104482650757},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.7121094465255737},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6996812224388123},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6065972447395325},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5919570922851562},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4992060661315918},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4768863022327423},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4504642188549042},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4431209862232208},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3780336380004883},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2851308584213257},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10035905241966248},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09560176730155945}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7667478322982788},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7167104482650757},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7121094465255737},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6996812224388123},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6065972447395325},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5919570922851562},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4992060661315918},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4768863022327423},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4504642188549042},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4431209862232208},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3780336380004883},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2851308584213257},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10035905241966248},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09560176730155945},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00453-006-1210-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-006-1210-5","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:CiteSeerX.psu:10.1.1.269.6247","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.269.6247","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.springerlink.com/content/m5710531h2514815/fulltext.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.94.8160","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.8160","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uiuc.edu/homes/chekuri/papers/ufp.pdf","raw_type":"text"},{"id":"pmh:oai:figshare.com:article/6603611","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Approximation_Algorithms_for_the_Unsplittable_Flow_Problem/6603611","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"doi:10.1184/r1/6603611.v1","is_oa":true,"landing_page_url":"https://doi.org/10.1184/r1/6603611.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"JournalArticle"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/6603611","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Approximation_Algorithms_for_the_Unsplittable_Flow_Problem/6603611","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1559202792","https://openalex.org/W1589172288","https://openalex.org/W1591562949","https://openalex.org/W1608651920","https://openalex.org/W1963547452","https://openalex.org/W1969534344","https://openalex.org/W1974115975","https://openalex.org/W1989234747","https://openalex.org/W1993119087","https://openalex.org/W1994611404","https://openalex.org/W2003902046","https://openalex.org/W2005509629","https://openalex.org/W2014023522","https://openalex.org/W2019062750","https://openalex.org/W2022191808","https://openalex.org/W2025050335","https://openalex.org/W2032312374","https://openalex.org/W2034269606","https://openalex.org/W2058821164","https://openalex.org/W2068871408","https://openalex.org/W2069832779","https://openalex.org/W2074557115","https://openalex.org/W2074762809","https://openalex.org/W2108736261","https://openalex.org/W2117595194","https://openalex.org/W2134422938","https://openalex.org/W2135424293","https://openalex.org/W2139739478","https://openalex.org/W2150148016","https://openalex.org/W2154571828","https://openalex.org/W2156068267","https://openalex.org/W2165956524","https://openalex.org/W2295428206","https://openalex.org/W2338905098","https://openalex.org/W3011766368"],"related_works":["https://openalex.org/W4220780102","https://openalex.org/W1502401885","https://openalex.org/W2410881844","https://openalex.org/W2072291569","https://openalex.org/W2543175834","https://openalex.org/W2032550399","https://openalex.org/W2057791178","https://openalex.org/W2136838521","https://openalex.org/W2070751425","https://openalex.org/W2963158951"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}