A preemptive algorithm for maximizing disjoint paths on trees

DOI10.1007/S00453-009-9305-4zbMath1201.68158OpenAlexW4240113301MaRDI QIDQ970615

Daniel Glasner, Yossi Azar

Publication date: 19 May 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-009-9305-4

zbMATH Keywords

online algorithmsadmission controldisjoint pathscall controldisjoint paths on trees

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

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