A Preemptive Algorithm for Maximizing Disjoint Paths on Trees

DOI10.1007/978-3-540-69903-3_29MaRDI QIDQ3512469zbMATH OpenOpenAlexFDO

Authors Daniel Glasner, Yossi Azar, Uriel Feige

Publication date 15 July 2008

Published in Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69903-3_29

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Recommendations

• A preemptive algorithm for maximizing disjoint paths on trees
• Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
• scientific article; zbMATH DE number 1305386
• scientific article; zbMATH DE number 1559551
• scientific article; zbMATH DE number 2086258

Cites work

• scientific article; zbMATH DE number 1003261 (Why is no real title available?)
• scientific article; zbMATH DE number 1003262 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1256772 (Why is no real title available?)
• scientific article; zbMATH DE number 1261807 (Why is no real title available?)
• scientific article; zbMATH DE number 1303572 (Why is no real title available?)
• scientific article; zbMATH DE number 1305386 (Why is no real title available?)
• scientific article; zbMATH DE number 1418264 (Why is no real title available?)
• Efficient On-Line Call Control Algorithms
• On-line competitive algorithms for call admission in optical networks
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Primal-dual approximation algorithms for integral flow and multicut in trees
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs

Cited in

(3)

• A preemptive algorithm for maximizing disjoint paths on trees
• An online algorithm for the dynamic maximal dense tree problem
• Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms

This page was built for publication: A Preemptive Algorithm for Maximizing Disjoint Paths on Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512469)