On the maximum acyclic subgraph problem under disjunctive constraints (Q477599)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the maximum acyclic subgraph problem under disjunctive constraints |
scientific article; zbMATH DE number 6378638
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the maximum acyclic subgraph problem under disjunctive constraints |
scientific article; zbMATH DE number 6378638 |
Statements
On the maximum acyclic subgraph problem under disjunctive constraints (English)
0 references
9 December 2014
0 references
maximum acyclic subgraph problem
0 references
disjunctive constraints
0 references
approximation algorithms
0 references
computational complexity
0 references
0.8021605610847473
0 references
0.7917377948760986
0 references
0.7779707908630371
0 references
0.7753221988677979
0 references
0.7656008005142212
0 references
