Packing cycles in undirected graphs

Journal of Algorithms

Volumn 48, Issue 1, 2003, Pages 239-256

  Caprara, Alberto ^a   Panconesi, Alessandro ^a   Rizzi, Romeo ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Approximation; Complexity; Edge disjoint cycles; Linear programming relaxation; Packing

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; PROBLEM SOLVING; RELAXATION PROCESSES;

PACKING CYCLES;

GRAPH THEORY;

EID: 0042929914     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00052-X     Document Type: Conference Paper

References (11)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi, Combinatorial Optimization Problems and their Approximability Properties, Springer-Verlag, Berlin, 1999.
2. V. Bafna, P.A. Pevzner, Genome rearrangements and sorting by reversals, SIAM J. Comput. 25 (1996) 272-289.
3. P. Berman, M. Karpinski, On some tighter inapproximability results, in: Proceedings of the 26th International Colloquium on Automata, Languages and Programming, in: Lecture Notes in Comput. Sci., Vol. 1644, Springer-Verlag, Berlin, 2000, pp. 200-209.
4. B. Bollobás, Extremal Graph Theory, Academic Press, New York, 1978.
5. A. Caprara, Sorting Permutations by reversals and Eulerian cycle decompositions, SIAM J. Discrete Math. 12 (1999) 91-110.
6. A. Caprara, A. Panconesi, R. Rizzi, Packing cuts in undirected graphs. Research Report OR/01/14, DEIS, University of Bologna, 2001, available at http://www.or.deis.unibo.it/alberto/online.htm.
7. P. Erdos, L. Pósa, On the maximal number of disjoint circuits of a graph, Publ. Math. Debrecen 9 (1962) 3-12.
8. A. Frank, Conservative weightings and ear-decompositions of graphs, Combinatorica 13 (1993) 65-81.
9. I. Holyer, The NP-completeness of some edge-partition problems, SIAM J. Comput. 10 (1981) 713-717.
10. J. Kececioglu, D. Sankoff, Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement, Algorithmica 13 (1995) 180-210.
11. D. Lichtenstein, Planar formulae and their uses, SIAM J. Comput. 11 (1982) 329-343.