Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736)
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: Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems |
scientific article; zbMATH DE number 6163642
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems |
scientific article; zbMATH DE number 6163642 |
Statements
Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (English)
0 references
16 May 2013
0 references
inclusion-exclusion
0 references
fixed parameter tractability
0 references
exact algorithms
0 references
polynomial space
0 references
Steiner tree
0 references