Tight Bounds for the Maximum Acyclic Subgraph Problem-Reference-Cited by-同舟云学术

Tight Bounds for the Maximum Acyclic Subgraph Problem

Published:1997-10 Issue:1 Volume:25 Page:1-18
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Berger Bonnie,Shor Peter W

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference23 articles.

1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Oct. 1992, Proof verification and hardness of approximation problems, Proceedings of the 33nd Annual Symposium on Foundations of Computer Science, IEEE, 14, 23

2. B. Berger, Jan. 1991, The fourth moment method, Proceedings of the Second Annual ACM/SIAM Symposium on Discrete Algorithms, ACM/SIAM, 373, 383

3. B. Berger, P. W. Shor, Jan. 1990, Approximation algorithms for the maximum acyclic subgraph problem, Proceedings of the First Annual ACM/SIAM Symposium on Discrete Algorithms, ACM/SIAM, 236, 243

4. On the maximum cardinality of a consistent set of arcs in a random tournament;de la Vega;J. Combin. Theory Ser. B,1983

5. On a combinatorial game;Erdös;J. Combin. Theory Ser. A,1973

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fast Iterative Graph Computing with Updated Neighbor States;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

2. Extremal results on feedback arc sets in digraphs;Random Structures & Algorithms;2023-08-21

3. Maximal Acyclic Subgraphs and Closest Stable Matrices;SIAM Journal on Matrix Analysis and Applications;2020-01

4. Intersections of random hypergraphs and tournaments;European Journal of Combinatorics;2015-02

5. Approximating Bounded Occurrence Ordering CSPs;Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques;2012