scientific article
From MaRDI portal
Publication:2921712
zbMath1297.05127MaRDI QIDQ2921712
Raphael Yuster, Michael Krivelevich, Zeev Nutov
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)
Related Items (12)
Packing directed cycles efficiently ⋮ Packing arc-disjoint cycles in tournaments ⋮ Inapproximability of $H$-Transversal/Packing ⋮ Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs ⋮ Approximability of Packing Disjoint Cycles ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) ⋮ Maximum cycle packing in Eulerian graphs using local traces ⋮ Approximation algorithms for grooming in optical network design ⋮ Efficient approximation algorithms for shortest cycles in undirected graphs ⋮ Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs ⋮ Packing Arc-Disjoint Cycles in Tournaments ⋮ Unnamed Item
This page was built for publication:
