{"id":"https://openalex.org/W114729047","doi":"https://doi.org/10.1007/978-3-642-30376-0_7","title":"Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper Bounds","display_name":"Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper Bounds","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W114729047","doi":"https://doi.org/10.1007/978-3-642-30376-0_7","mag":"114729047"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-30376-0_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-30376-0_7","pdf_url":null,"source":{"id":"https://openalex.org/S4393917809","display_name":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","issn_l":"1867-8211","issn":["1867-8211","1867-822X"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","raw_type":"book-chapter"},"type":"book-chapter","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/A5060277232","display_name":"G\u00e1bor N\u00e9meth","orcid":"https://orcid.org/0000-0002-4531-0243"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"G\u00e1bor N\u00e9meth","raw_affiliation_strings":["Dept. of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Magyar tud\u00f3sok k\u00f6r\u00fatja 2., Budapest, Hungary, H-1117"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Magyar tud\u00f3sok k\u00f6r\u00fatja 2., Budapest, Hungary, H-1117","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014559047","display_name":"G\u00e1bor R\u00e9tv\u00e1ri","orcid":"https://orcid.org/0000-0002-5958-7817"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"G\u00e1bor R\u00e9tv\u00e1ri","raw_affiliation_strings":["Dept. of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Magyar tud\u00f3sok k\u00f6r\u00fatja 2., Budapest, Hungary, H-1117"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Magyar tud\u00f3sok k\u00f6r\u00fatja 2., Budapest, Hungary, H-1117","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6028,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64980359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"84","last_page":"100"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"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.9983000159263611,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9943000078201294,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9918000102043152,"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/computer-science","display_name":"Computer science","score":0.6615089178085327},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5869268178939819},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5806477069854736},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5659688711166382},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.46922218799591064},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4373210072517395},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42582884430885315},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3787353038787842},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24685430526733398},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.228488028049469},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10676693916320801}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6615089178085327},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5869268178939819},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5806477069854736},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5659688711166382},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.46922218799591064},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4373210072517395},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42582884430885315},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3787353038787842},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24685430526733398},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.228488028049469},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10676693916320801},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-30376-0_7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-30376-0_7","pdf_url":null,"source":{"id":"https://openalex.org/S4393917809","display_name":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","issn_l":"1867-8211","issn":["1867-8211","1867-822X"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.677.9088","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.677.9088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eudl.eu/pdf/10.1007/978-3-642-30376-0_7/","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1597196612","https://openalex.org/W1612056114","https://openalex.org/W1692527761","https://openalex.org/W1969910155","https://openalex.org/W1970205955","https://openalex.org/W1971443646","https://openalex.org/W1971529969","https://openalex.org/W2066376225","https://openalex.org/W2084706168","https://openalex.org/W2095419571","https://openalex.org/W2096354901","https://openalex.org/W2106481801","https://openalex.org/W2109015671","https://openalex.org/W2119751760","https://openalex.org/W2121756644","https://openalex.org/W2130127658","https://openalex.org/W2134577144","https://openalex.org/W2135513176","https://openalex.org/W2136558412","https://openalex.org/W2143508387","https://openalex.org/W2144472425","https://openalex.org/W2145818650","https://openalex.org/W2154965732","https://openalex.org/W2158755379","https://openalex.org/W2158893758","https://openalex.org/W2159854304","https://openalex.org/W2164096531","https://openalex.org/W2165030634","https://openalex.org/W2500058918","https://openalex.org/W3003143665","https://openalex.org/W3039948875","https://openalex.org/W3043060850","https://openalex.org/W4213272272","https://openalex.org/W4250422944","https://openalex.org/W4254436734"],"related_works":["https://openalex.org/W2366107444","https://openalex.org/W4388145910","https://openalex.org/W1976205134","https://openalex.org/W2381570729","https://openalex.org/W4248336175","https://openalex.org/W3009369890","https://openalex.org/W2031260042","https://openalex.org/W2391445434","https://openalex.org/W4312490297","https://openalex.org/W2062212388"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}