A Preemptive Algorithm for Maximizing Disjoint Paths on Trees

DOI10.1007/978-3-540-69903-3_29zbMath1155.68568OpenAlexW2016969167MaRDI QIDQ3512469

Daniel Glasner, Yossi Azar

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primal-dual approximation algorithms for integral flow and multicut in trees
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Efficient On-Line Call Control Algorithms
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• On-line competitive algorithms for call admission in optical networks

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