The complexity of packing edge-disjoint paths

DOI10.4230/LIPICS.IPEC.2019.10MaRDI QIDQ5875542zbMATH OpenOpenAlexFDO

Authors Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Bjoern Tauer, Hung-Lung Wang, Peter Rossmanith

Publication date 3 February 2023

Full work available at URL https://arxiv.org/abs/1910.00440

zbMATH Keywords

coveringembeddingHamiltonian pathpackingparameterized complexitypath-perfect graphsunary binpacking

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Cited in

(3)

• Approximating disjoint-path problems using packing integer programs
• The path set packing problem
• Geodesic packing in graphs

This page was built for publication: The complexity of packing edge-disjoint paths

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