Approximations for the maximum acyclic subgraph problem
type: Item
instance of: scholarly article
title: Approximations for the maximum acyclic subgraph problem
zbMATH Open document ID: 0942.68644
DOI: 10.1016/0020-0190(94)00086-7
author: Shlomi Rubinstein
author: Refael Hassin
published in: Information Processing Letters
publication date: 2000-08-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 633501
Wikidata QID: Q59650035
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00086-7
OpenAlex ID: W2072500816
cites work: Q4004078
cites work: Q3138899
cites work: Exact and heuristic algorithms for the weighted feedback arc set problem: A special case of the skew-symmetric quadratic assignment problem
cites work: How to make a digraph strongly connected
cites work: Q3140422
cites work: On the acyclic subgraph polytope
cites work: Geometric algorithms and combinatorial optimization
cites work: Approximative Algorithms for Discrete Optimization Problems
cites work: A branch and bound algorithm for the acyclic subgraph problem
cites work: An Analysis of the Greedy Heuristic for Independence Systems
cites work: Q3221421
cites work: Fair edge deletion problems
cites work: Q3985346
cites work: Optimization, approximation, and complexity classes
cites work: Finding a minimum feedback arc set in reducible flow graphs
cites work: Node-and edge-deletion NP-complete problems
description: scientific article; zbMATH DE number 633501