Approximation algorithms for the maximum acyclic subgraph problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1990, Pages 236-243

  Berger, Bonnie ^a   Shor, Peter W ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; DIRECTED GRAPHS; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

ACYCLIC SUBGRAPH; ACYCLIC SUBGRAPHS; CARDINALITIES; GRAPH G; LOW DEGREE GRAPHS; MAXIMUM DEGREE; POLYNOMIAL-TIME;

GRAPH THEORY;

EID: 85009510014     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. c n) - wise Independence in NC, 30th IEEE Symposium on Foundations of Computer Science, 1989.
2. [D] De la Vega, W. F., "On the maximum cardinality of a consistent set of arcs in a random tournament", J. Combin. Theory, Ser. B 35, 1983, pp. 328-332.
3. [GJ] Garey, M. R., D. S. Johnson, Computers and Inlraciability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1981.
4. [K] Karp, R. M., "Reducibility among combinatorial problems." In Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, 1972, pp. 85-103.
5. [LR88] Leighton, T., S. Rao, An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms 29th IEEE Symposium on Foundations of Computer Science, 1988, pp. 422-431.
6. [LR89] Leighton, T., S. Rao, personal communication.
7. [PY89] Papadimitriou, C. H. and M. Yannakakis, "Optimization, Approximation, and Complexity Classes", manuscript. An earlier version, which does not contain the relevant result, appeared in Proceedings 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 229-234.
8. [Rag] Raghavan, P., "Probabilistic construction of deterministic algorithms: approximating packing integer programs", JCSS 37, 1988, pp. 130-143.
9. [Ram] Ramachandran, V., "Finding a minimum feedback arc set in reducible flow graphs", J. Algorithms, to appear.
10. [S] Spencer, J., Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, 1987.