{"id":"https://openalex.org/W2005779944","doi":"https://doi.org/10.1145/1148109.1148148","title":"Semi-oblivious routing","display_name":"Semi-oblivious routing","publication_year":2006,"publication_date":"2006-07-30","ids":{"openalex":"https://openalex.org/W2005779944","doi":"https://doi.org/10.1145/1148109.1148148","mag":"2005779944"},"language":"en","primary_location":{"id":"doi:10.1145/1148109.1148148","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148148","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"conference-paper","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/A5111876448","display_name":"MohammadTaghi Hajiaghayi","orcid":null},"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":false,"raw_author_name":"MohammadTaghi Hajiaghayi","raw_affiliation_strings":["Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040052580","display_name":"Robert Kleinberg","orcid":"https://orcid.org/0000-0002-8306-3407"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Kleinberg","raw_affiliation_strings":["University of California, Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113572159","display_name":"Tom Leighton","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tom Leighton","raw_affiliation_strings":["Massahusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massahusetts Institute of Technology","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.235,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.42129317,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"234","last_page":"234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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.9987999796867371,"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/computer-science","display_name":"Computer science","score":0.6854463219642639},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5881630182266235},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5488765835762024},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5352255702018738},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.46339064836502075},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.45577219128608704},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.45325735211372375},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4261133372783661},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.285728394985199},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26218125224113464},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1764034926891327}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6854463219642639},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5881630182266235},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5488765835762024},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5352255702018738},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.46339064836502075},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45577219128608704},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.45325735211372375},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4261133372783661},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.285728394985199},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26218125224113464},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1764034926891327},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"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.1145/1148109.1148148","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148148","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1963964297","https://openalex.org/W1971443646","https://openalex.org/W2020066367","https://openalex.org/W2145818650"],"related_works":["https://openalex.org/W2139584334","https://openalex.org/W757657516","https://openalex.org/W2539097916","https://openalex.org/W4377970799","https://openalex.org/W2944616377","https://openalex.org/W3127002380","https://openalex.org/W2168517869","https://openalex.org/W2251995179","https://openalex.org/W2556128816","https://openalex.org/W2351878639"],"abstract_inverted_index":{"We":[0,63],"introduce":[1],"semi-oblivious":[2,49],"routing,":[3],"a":[4,17,57,60],"generalization":[5],"of":[6,20,47,73],"oblivious":[7],"routing":[8,50,75],"in":[9,77],"which":[10,22,40],"multicommodity":[11],"flows":[12],"must":[13],"be":[14],"routed":[15],"using":[16],"polynomial-sized":[18],"set":[19],"paths":[21],"is":[23,36,56],"predefined":[24],"by":[25],"the":[26,29,33,45,54,71,78],"algorithm":[27],"before":[28],"demand":[30],"matrix":[31],"for":[32],"flow":[34],"problem":[35],"revealed.":[37],"Our":[38],"results,":[39],"are":[41],"primarily":[42],"negative,":[43],"exclude":[44],"possibility":[46],"constant-competitive":[48],"schemes,":[51],"even":[52,66],"when":[53],"network":[55],"grid":[58],"or":[59],"seriesparallel":[61],"graph.":[62],"provide":[64],"an":[65],"stronger":[67],"lower":[68],"bound":[69],"on":[70],"congestion":[72],"constant-bend":[74],"schemes":[76],"grid.":[79]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}