scientific article; zbMATH DE number 1305386

zbMATH Open0946.68159MaRDI QIDQ4252265FDOQ4252265

Authors: Ran Adler, Yossi Azar 

Publication date: 17 October 2000

Title of this publication is not available (Why is that?)

Recommendations

• Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
• A preemptive algorithm for maximizing disjoint paths on trees
• A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
• scientific article; zbMATH DE number 1003262

zbMATH Keywords

call controlmaximum disjoint paths

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cited In (6)

• A preemptive algorithm for maximizing disjoint paths on trees
• A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
• Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
• Online submodular maximization with preemption
• Buyback problem -- approximate matroid intersection with cancellation costs
• Simple on-line algorithms for the maximum disjoint paths problem

This page was built for publication:

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