Complexity and approximability of minimum path-collection exact covers (Q2110360)
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: Complexity and approximability of minimum path-collection exact covers |
scientific article; zbMATH DE number 7635991
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and approximability of minimum path-collection exact covers |
scientific article; zbMATH DE number 7635991 |
Statements
Complexity and approximability of minimum path-collection exact covers (English)
0 references
21 December 2022
0 references
exact edge cover
0 references
computational complexity
0 references
approximability
0 references
polynomial-time algorithm
0 references
combinatorial optimization
0 references
