A Preemptive Algorithm for Maximizing Disjoint Paths on Trees

DOI10.1007/978-3-540-69903-3_29zbMATH Open1155.68568OpenAlexW2016969167MaRDI QIDQ3512469FDOQ3512469

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

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)