Improved algorithm for the half-disjoint paths problem

DOI10.1007/978-3-642-15369-3_22MaRDI QIDQ3588415zbMATH OpenOpenAlexFDO

Authors Ken-ichi Kawarabayashi, Yusuke Kobayashi

Publication date 10 September 2010

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15369-3_22

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Paths and cycles (05C38)

Recommendations

• An improved algorithm for the half-disjoint paths problem
• scientific article; zbMATH DE number 1775441
• Graph minors. XIII: The disjoint paths problem
• A nearly linear time algorithm for the half integral parity disjoint paths packing problem
• On the disjoint paths problem

Cited in

(6)

• Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints
• Half-integral linkages in highly connected directed graphs
• Improved Algorithms for the 2-Vertex Disjoint Paths Problem
• Faster algorithms for half-integral \(T\)-path packing
• scientific article; zbMATH DE number 1775441 (Why is no real title available?)
• An improved algorithm for the half-disjoint paths problem

This page was built for publication: Improved algorithm for the half-disjoint paths problem

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