Approximability of packing disjoint cycles
type: Item
instance of: scholarly article
title: Approximability of packing disjoint cycles
zbMATH Open document ID: 1213.05245
author: Zachary Friggstad
author: Mohammad Salavatipour
published in: Algorithmica
publication date: 2011-05-10T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5886434
zbMATH Keywords: Approximation
zbMATH Keywords: Hardness of approximation
zbMATH Keywords: Edge-disjoint cycles
zbMATH Keywords: Edge-disjoint paths
zbMATH Keywords: Integrality gap
MaRDI profile type: Publication
OpenAlex ID: W2043985142
cites work: Hardness of the undirected edge-disjoint paths problem
cites work: Packing Digraphs with Directed Closed Trails
cites work: Packing cycles in undirected graphs
cites work: Q3002769
cites work: Asymmetric k -center is log * n -hard to approximate
cites work: Approximability of Packing Disjoint Cycles
cites work: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
cites work: Complete partitions of graphs
cites work: Approximation algorithms and hardness results for cycle packing problems
cites work: A PCP characterization of NP with optimal amortized query complexity
cites work: Packing directed circuits fractionally
cites work: Q5501283
DOI: 10.1007/S00453-009-9349-5
description: scientific article; zbMATH DE number 5886434