The path set packing problem

DOI10.1007/978-3-319-94776-1_26MaRDI QIDQ1790987zbMATH OpenOpenAlexFDO

Authors Chenyang Xu, Guochuan Zhang

Publication date 4 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94776-1_26

zbMATH Keywords

parameterized algorithmmaximum number of edge-disjoint paths

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Path packing and a related optimization problem
• Parameterized complexity of path set packing
• scientific article; zbMATH DE number 4089565
• Packing paths in complete graphs
• Packing paths in planar graphs
• Integer Programming and Combinatorial Optimization
• Packing paths in digraphs
• The complexity of packing edge-disjoint paths
• The graph-bin packing problem
• Packing paths of length at least two

Cited in

(11)

• scientific article; zbMATH DE number 4089565 (Why is no real title available?)
• Approximating disjoint-path problems using packing integer programs
• Parameterized complexity of path set packing
• On a Network Design Problem That Is Intractable on Trees
• An evolutionary algorithm based hyper-heuristic framework for the set packing problem
• A Fast Algorithm for Path 2-Packing Problem
• The board packing problem
• On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes
• A fast algorithm for the path 2-packing problem
• Packing paths: recycling saves time
• Shortest \((A+B)\)-path packing via hafnian

This page was built for publication: The path set packing problem

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