{"id":"https://openalex.org/W2036125948","doi":"https://doi.org/10.1007/bf01759035","title":"Multiterminal global routing: A deterministic approximation scheme","display_name":"Multiterminal global routing: A deterministic approximation scheme","publication_year":1991,"publication_date":"1991-06-01","ids":{"openalex":"https://openalex.org/W2036125948","doi":"https://doi.org/10.1007/bf01759035","mag":"2036125948"},"language":"en","primary_location":{"id":"doi:10.1007/bf01759035","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01759035","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"],"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/A5078491738","display_name":"Prabhakar Raghavan","orcid":"https://orcid.org/0000-0001-9853-7604"},"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":true,"raw_author_name":"Prabhakar Raghavan","raw_affiliation_strings":["IBM T. J. Watson Research Center, P.O. Box 218, 10598, Yorktown Heights, NY, USA","IBM T.J. Watson Research Center, Yorktown Heights, USA 10598#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM T. J. Watson Research Center, P.O. Box 218, 10598, Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I1341412227"]},{"raw_affiliation_string":"IBM T.J. Watson Research Center, Yorktown Heights, USA 10598#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108198468","display_name":"Clark D. Thompson","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]},{"id":"https://openalex.org/I4210115145","display_name":"University of Minnesota, Duluth","ror":"https://ror.org/01hy4qx27","country_code":"US","type":"education","lineage":["https://openalex.org/I4210115145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Clark D. Thompson","raw_affiliation_strings":["Department of Computer Science, University of Minnesota, 55812, Duluth, MN, USA","Department of Computer Science, University of Minnesota, Duluth, USA 55812#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Minnesota, 55812, Duluth, MN, USA","institution_ids":["https://openalex.org/I4210115145"]},{"raw_affiliation_string":"Department of Computer Science, University of Minnesota, Duluth, USA 55812#TAB#","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078491738"],"corresponding_institution_ids":["https://openalex.org/I1341412227"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.0034,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.9011625,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"6","issue":"1-6","first_page":"73","last_page":"82"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9965999722480774,"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/rounding","display_name":"Rounding","score":0.859225869178772},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.680888295173645},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6578632593154907},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.6225182414054871},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.5935782194137573},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5717238783836365},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5614031553268433},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5279430747032166},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5151025652885437},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4983022212982178},{"id":"https://openalex.org/keywords/net","display_name":"Net (polyhedron)","score":0.4705508053302765},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4657818675041199},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4494306445121765},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43588557839393616},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4340709447860718},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43091124296188354},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43056607246398926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3957114517688751},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.26245933771133423}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.859225869178772},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.680888295173645},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6578632593154907},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.6225182414054871},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.5935782194137573},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5717238783836365},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5614031553268433},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5279430747032166},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5151025652885437},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4983022212982178},{"id":"https://openalex.org/C14166107","wikidata":"https://www.wikidata.org/wiki/Q253829","display_name":"Net (polyhedron)","level":2,"score":0.4705508053302765},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4657818675041199},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4494306445121765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43588557839393616},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4340709447860718},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43091124296188354},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43056607246398926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3957114517688751},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.26245933771133423},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01759035","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01759035","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W172499693","https://openalex.org/W604490888","https://openalex.org/W1485193993","https://openalex.org/W1979569488","https://openalex.org/W1984648501","https://openalex.org/W2020498688","https://openalex.org/W2024631575","https://openalex.org/W2031904783","https://openalex.org/W2064779029","https://openalex.org/W2081013866","https://openalex.org/W2116683188","https://openalex.org/W2140322654","https://openalex.org/W2153580689","https://openalex.org/W2611147814"],"related_works":["https://openalex.org/W1964024778","https://openalex.org/W2499939553","https://openalex.org/W2486684489","https://openalex.org/W1990925151","https://openalex.org/W4306168826","https://openalex.org/W3013656193","https://openalex.org/W2119274774","https://openalex.org/W2003418818","https://openalex.org/W1989289072","https://openalex.org/W2470126219"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}