Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
A characterization of Seymour graphs
Journal of Graph Theory
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
SIAM Journal on Discrete Mathematics
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing
A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Extremal Graph Theory
Packing triangles in bounded degree graphs
Information Processing Letters
| Hi-index | 0.00 |
We study the complexity and approximability of Cut Packing and Cycle Packing. For Cycle Packing, we show that the problem is APX-hard but can be approximated within a factor of O(log n) by a simple greedy approach. Essentially the same approach achieves constant approximation for "dense" graphs. We show that both problems are NP-hard for planar graphs. For Cut Packing we show that, given a graph G the maximum cut packing is always between α(G) and 2α(G). We then derive new or improved polynomial-time algorithms for Cut Packing for special classes of graphs.