{"id":"https://openalex.org/W1518652321","doi":"https://doi.org/10.1007/3-540-45995-2_50","title":"On-line Algorithms for Edge-Disjoint Paths in Trees of Rings","display_name":"On-line Algorithms for Edge-Disjoint Paths in Trees of Rings","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1518652321","doi":"https://doi.org/10.1007/3-540-45995-2_50","mag":"1518652321"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45995-2_50","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45995-2_50","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","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/A5071333728","display_name":"Rohit Anand","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"R. Sai Anand","raw_affiliation_strings":["Computer Engineering and Networks Laboratory (TIK), Eidgen\u00f6ssische Technische Hochschule Z\u00fcrich, 8092, Z\u00fcrich, CH, Switzerland"],"affiliations":[{"raw_affiliation_string":"Computer Engineering and Networks Laboratory (TIK), Eidgen\u00f6ssische Technische Hochschule Z\u00fcrich, 8092, Z\u00fcrich, CH, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049579750","display_name":"Thomas Erlebach","orcid":"https://orcid.org/0000-0002-4470-5868"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Thomas Erlebach","raw_affiliation_strings":["Computer Engineering and Networks Laboratory (TIK), Eidgen\u00f6ssische Technische Hochschule Z\u00fcrich, 8092, Z\u00fcrich, CH, Switzerland"],"affiliations":[{"raw_affiliation_string":"Computer Engineering and Networks Laboratory (TIK), Eidgen\u00f6ssische Technische Hochschule Z\u00fcrich, 8092, Z\u00fcrich, CH, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071333728"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8432,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.76434676,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"584","last_page":"597"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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.9980000257492065,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9979000091552734,"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/vertex","display_name":"Vertex (graph theory)","score":0.6278241872787476},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5979490876197815},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5917902588844299},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5631940364837646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5304046869277954},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5218707323074341},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5087123513221741},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4749184548854828},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4510117173194885},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.44400957226753235},{"id":"https://openalex.org/keywords/ring","display_name":"Ring (chemistry)","score":0.42828524112701416},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4256178140640259},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39257651567459106},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34752392768859863},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2937585413455963},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.27553749084472656},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.11695548892021179},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08039963245391846},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07719641923904419}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6278241872787476},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5979490876197815},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5917902588844299},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5631940364837646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5304046869277954},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5218707323074341},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5087123513221741},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4749184548854828},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4510117173194885},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.44400957226753235},{"id":"https://openalex.org/C2780378348","wikidata":"https://www.wikidata.org/wiki/Q25351438","display_name":"Ring (chemistry)","level":2,"score":0.42828524112701416},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4256178140640259},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39257651567459106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34752392768859863},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2937585413455963},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.27553749084472656},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.11695548892021179},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08039963245391846},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07719641923904419},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-45995-2_50","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45995-2_50","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1525584233","https://openalex.org/W1552828154","https://openalex.org/W1590340002","https://openalex.org/W1955839943","https://openalex.org/W1993066545","https://openalex.org/W2004681879","https://openalex.org/W2020384210","https://openalex.org/W2080354718","https://openalex.org/W2081414879","https://openalex.org/W2114218179","https://openalex.org/W2121839513","https://openalex.org/W2139739478","https://openalex.org/W4389615578","https://openalex.org/W6999939165"],"related_works":["https://openalex.org/W2001689746","https://openalex.org/W2007609084","https://openalex.org/W2792400501","https://openalex.org/W2359807192","https://openalex.org/W2067759619","https://openalex.org/W2489256354","https://openalex.org/W1540916342","https://openalex.org/W2304323820","https://openalex.org/W2024199467","https://openalex.org/W2253092483"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}