Approximation algorithms for cycle packing problems
From MaRDI portal
Recommendations
Cited in
(27)- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
- On the Cycle Augmentation Problem: hardness and approximation algorithms
- Maximum cycle packing in Eulerian graphs using local traces
- Packing arc-disjoint cycles in tournaments
- scientific article; zbMATH DE number 3882483 (Why is no real title available?)
- Disjoint Cycles: Integrality Gap, Hardness, and Approximation
- Packing cycles exactly in polynomial time
- Packing cycles in undirected graphs
- scientific article; zbMATH DE number 1875440 (Why is no real title available?)
- Approximation algorithms and hardness results for cycle packing problems
- Maximum cycle packing using SPR-trees
- Packing Arc-Disjoint Cycles in Tournaments
- Mathematical Foundations of Computer Science 2004
- Approximability of packing disjoint cycles
- Inapproximability of \(H\)-transversal/packing
- Approximability of Packing Disjoint Cycles
- Parameterized Approximability of the Disjoint Cycle Problem
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
- Approximation algorithms for grooming in optical network design
- scientific article; zbMATH DE number 7053319 (Why is no real title available?)
- Approximating maximum subgraphs without short cycles
- Approximating Maximum Subgraphs without Short Cycles
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
- Approximation algorithms for the maximum-weight cycle/path packing problems
- Packing directed cycles efficiently
- Efficient approximation algorithms for shortest cycles in undirected graphs
- On packing shortest cycles in graphs
This page was built for publication: Approximation algorithms for cycle packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921712)
