{"id":"https://openalex.org/W4240113301","doi":"https://doi.org/10.1007/s00453-009-9305-4","title":"A Preemptive Algorithm for Maximizing Disjoint Paths on Trees","display_name":"A Preemptive Algorithm for Maximizing Disjoint Paths on Trees","publication_year":2009,"publication_date":"2009-04-07","ids":{"openalex":"https://openalex.org/W4240113301","doi":"https://doi.org/10.1007/s00453-009-9305-4"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-009-9305-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-009-9305-4","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/A5082061504","display_name":"Yossi Azar","orcid":"https://orcid.org/0000-0002-5097-8993"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"Yossi Azar","raw_affiliation_strings":["Microsoft Research, Redmond, WA, 98052-6399, USA","Tel Aviv University, Tel Aviv, 69978, Israel","Microsoft Research, Redmond, USA","Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, 98052-6399, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, 69978, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Microsoft Research, Redmond, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013190102","display_name":"Uriel Feige","orcid":"https://orcid.org/0009-0006-3749-4392"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Uriel Feige","raw_affiliation_strings":["Weizmann Institute, Rehovot, 76100, Israel","Weizmann Institute, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Weizmann Institute, Rehovot, 76100, Israel","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"Weizmann Institute, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001667895","display_name":"Daniel Gl\u00e4sner","orcid":null},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Daniel Glasner","raw_affiliation_strings":["Weizmann Institute, Rehovot, 76100, Israel","Weizmann Institute, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Weizmann Institute, Rehovot, 76100, Israel","institution_ids":["https://openalex.org/I53964585"]},{"raw_affiliation_string":"Weizmann Institute, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001667895"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.4053,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.7882175,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"57","issue":"3","first_page":"517","last_page":"537"},"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.9991000294685364,"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.9934999942779541,"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/competitive-analysis","display_name":"Competitive analysis","score":0.7749468088150024},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6064469814300537},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5463765263557434},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.5390886664390564},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5275440216064453},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5260417461395264},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5171070098876953},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5074846148490906},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.46496087312698364},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4470137655735016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4418811500072479},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.43719029426574707},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.43268996477127075},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.41607123613357544},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40004029870033264},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.352586567401886},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21403422951698303}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7749468088150024},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6064469814300537},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5463765263557434},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.5390886664390564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5275440216064453},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5260417461395264},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5171070098876953},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5074846148490906},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.46496087312698364},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4470137655735016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4418811500072479},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.43719029426574707},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.43268996477127075},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.41607123613357544},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40004029870033264},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.352586567401886},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21403422951698303},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-009-9305-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-009-9305-4","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/W1552828154","https://openalex.org/W1582510186","https://openalex.org/W2019062750","https://openalex.org/W2022191808","https://openalex.org/W2041839348","https://openalex.org/W2081414879","https://openalex.org/W2114218179","https://openalex.org/W2121839513","https://openalex.org/W2139739478","https://openalex.org/W2154571828","https://openalex.org/W2156707433","https://openalex.org/W2156867662","https://openalex.org/W2173141774","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W2752015945","https://openalex.org/W3135987664","https://openalex.org/W2051209951","https://openalex.org/W1493790977","https://openalex.org/W2208110155","https://openalex.org/W1996806106","https://openalex.org/W2781235162","https://openalex.org/W2058681277","https://openalex.org/W2090027528","https://openalex.org/W2047204419"],"abstract_inverted_index":null,"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}