scientific article; zbMATH DE number 1305386

MaRDI QIDQ4252265zbMATH OpenFDO

Authors Ran Adler, Yossi Azar

Publication date 17 October 2000

zbMATH Keywords

call controlmaximum disjoint paths

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

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

Cited in

(6)

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

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)