Improved Algorithm for the Half-Disjoint Paths Problem

DOI10.1007/978-3-642-15369-3_22zbMATH Open1305.68340OpenAlexW1483343493MaRDI QIDQ3588415FDOQ3588415

Yusuke Kobayashi, Ken-ichi Kawarabayashi

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)

Cited In (2)

• Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints
• Improved Algorithms for the 2-Vertex 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)