Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: tutte_bhkk / rank | |||
Normal rank | |||
Revision as of 07:02, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems |
scientific article |
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
