Approximations for the maximum acyclic subgraph problem
- 1 August 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 51 (3) , 133-140
- https://doi.org/10.1016/0020-0190(94)00086-7
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problemNetworks, 1990
- Finding a minimum feedback arc set in reducible flow graphsJournal of Algorithms, 1988
- On the acyclic subgraph polytopeMathematical Programming, 1985
- A branch and bound algorithm for the acyclic subgraph problemEuropean Journal of Operational Research, 1981
- How to make a digraph strongly connectedCombinatorica, 1981
- Approximative Algorithms for Discrete Optimization ProblemsAnnals of Discrete Mathematics, 1979
- An Analysis of the Greedy Heuristic for Independence SystemsAnnals of Discrete Mathematics, 1978