Tight Bounds for the Maximum Acyclic Subgraph Problem

Journal of Algorithms

Volumn 25, Issue 1, 1997, Pages 1-18

  Berger, Bonnie ^a,c   Shor, Peter W ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242337403     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0864     Document Type: Article

References (24)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, in "Proceedings of the 33nd Annual Symposium on Foundations of Computer Science, IEEE, Oct. 1992," pp. 14-23.
2. B. Berger, The fourth moment method, in "Proceedings of the Second Annual ACM/SIAM Symposium on Discrete Algorithms, ACM/SIAM, Jan. 1991," pp. 373-383. [also SIAM J. Comput. 26, in press]
3. B. Berger, The fourth moment method, in "Proceedings of the Second Annual ACM/SIAM Symposium on Discrete Algorithms, ACM/SIAM, Jan. 1991," pp. 373-383. [also SIAM J. Comput. 26, in press]
4. B. Berger and P. W. Shor, Approximation algorithms for the maximum acyclic subgraph problem, in "Proceedings of the First Annual ACM/SIAM Symposium on Discrete Algorithms, ACM/SIAM, Jan. 1990," pp. 236-243.
5. W. Fernandez de la Vega, On the maximum cardinality of a consistent set of arcs in a random tournament, J. Combin. Theory Ser. B 35 (1983), 328-332.
6. P. Erdös and J. Selfridge, On a combinatorial game, J. Combin. Theory Ser. A 14 (1973), 298-301.
7. G. Even, J. Naor, B. Schieber, and M. Sudan, Approximating minimum feedback sets and multi-cuts in directed graphs, in "Integer Programming and Combinatorial Optimization" (E. Balas and J. Clausen, Eds.), Lecture Notes in Computer Science, Vol. 920, pp. 14-28, Springer-Verlag, Berlin/New York, 1995.
8. M. X. Goemans and D. P. Williamson, Primal-dual approximation algorithms for feedback problems in planar graphs, in "Integer Programming and Combinatorial Optimization," (W. H. Cunningham, S. T. McCormick, and M. Queyranne, Eds.), Lecture Notes in Computer Science, No. 1084, pp. 147-161, Springer-Verlag, Berlin/New York, 1996.
9. R. Greenlaw, The parallel complexity of approximation algorithms for the acyclic subgraph problem, Technical Report 90-61, Department of Computer Science, Univ. of New Hampshire, Durham, NH, Feb. 1990.
10. R. Karp, Reducibility among combinatorial problems, in "Complexity of Computer Computations," (R. E. Miller and J. W. Thatcher, Eds.), Plenum Press, New York, 1975.
11. P. Klein, C. Stein, and E. Tardos, Leighton-Rao might be practical, in "Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 1990," pp. 310-321.
12. R. H. Lathrop, R. J. Hall, and Robert S. Kirk, Functional abstraction from structure in VLSI simulation models, in "Proceedings of the 24th IEEE/ACM Design Automation Conference, Miami Beach, FL, June 1987, IEEE/ACM," pp. 822-828.
13. T. Leighton and S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in "Proceedings of the 29th Annual Symposium on Foundations of Computer Science, IEEE, Oct. 1988," pp. 422-431.
14. J. Leung, Private communication, 1989.
15. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43(3) (1991), 425-440.
16. S. Poljak, V. Rödl, and J. Spencer, Tournament ranking with expected profit in polynomial time, SIAM J. Discrete Math., 1 (1988), 372-376.
17. P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci. 37(4) (1988), 130-143.
18. V. Ramachandran, Finding a minimum feedback arc set in reducible flow graphs, J. Algorithms 9(3) (1988), 299-313.
19. S. Rao, "Finding Small Balanced Edge Cuts: Theory and Applications," Ph.D. thesis, EECS, MIT, Cambridge, MA, Aug. 1989.
20. P. D. Seymour, Packing directed circuits fractionally, Combinatorica 15 (1995), 281-288.
21. M. H. Shirley, "Generating Circuit Tests by Exploiting Designed Behavior," Technical Report MIT/AI/TR-1099, MIT Artificial Intelligence Laboratory, Cambridge, MA, Dec. 1988.
22. J. Spencer, Balancing games, J. Combin. Theory Ser. B 23 (1977), 68-74.
23. J. Spencer, "Ten Lectures on the Probabilistic Method," SIAM, Philadelphia, 1987.
24. H. Stamm, On feedback problems in planar digraphs, in "Graph-Theoretic Concepts in Computer Science," (R. H. Möhring, Ed.), Lecture Notes in Computer Science, No. 484, pp. 79-89, Springer-Verlag, Berlin/New York, 1990.