The maximum acyclic subgraph problem and degree-3 graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2129, Issue , 2015, Pages 147-158

  Newman, Alantha ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; DIRECTED GRAPHS; GRAPHIC METHODS; OPTIMIZATION; RANDOM PROCESSES;

ACYCLIC SUBGRAPH; APPROXIMABILITY; APPROXIMATION-PRESERVING REDUCTIONS; COMBINATORIAL ALGORITHM; GENERAL GRAPH; HALF APPROXIMATION; LOWER BOUNDS; MAXIMUM DEGREE 3;

APPROXIMATION ALGORITHMS;

EID: 84923116062     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (5)

1. Bonnie Berger and Peter W. Shor. Tight Bounds on the Maximum Acyclic Subgraph Problem, Journal of Algorithms, vol. 25, pages 1–18, 1997.
2. Richard M Karp. Reducibility Among Combinatorial Problems, Complexity of Computer Computations, Plenum Press, 1972.
3. Fang Chen and László Lovász. Personal communication via Santosh Vempala.
4. Alantha Newman. Approximating the Maximum Acyclic Subgraph, M.S. Thesis, MIT, June 2000.
5. Alantha Newman and Santosh Vempala. Fences Are Futile: On Relaxations for the Linear Ordering Problem, Proceedings of IPCO 2001, Springer-Verlag.