An approximation algorithm for maximum packing of 3-edge paths
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3428958 (Why is no real title available?)
- 25 pretty graph colouring problems
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
- Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
- `` Strong NP-Completeness Results
Cited in
(18)- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs
- Packing paths: recycling saves time
- Algorithms – ESA 2004
- Improved approximation algorithms for cycle and path packings
- An approximation algorithm for the maximum traveling salesman problem
- Approximating the maximum quadratic assignment problem
- A parameterized perspective on packing paths of length two
- An approximation algorithm for maximum triangle packing
- Local improvement algorithms for a path packing problem: a performance analysis based on linear programming
- A Parameterized Perspective on Packing Paths of Length Two
- Approximating the directed path partition problem
- Approximation results for the weighted \(P_4\) partition problem
- The path partition problem and related problems in bipartite graphs
- A local search algorithm for binary maximum 2-path partitioning
- Approximation algorithms for the maximum-weight cycle/path packing problems
- Improved approximation algorithms for weighted 2-path partitions
- Improved approximation algorithms for weighted 2-path partitions
- Differential approximation of NP-hard problems with equal size feasible solutions
This page was built for publication: An approximation algorithm for maximum packing of 3-edge paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287133)
