Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-012-9630-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2097782835 / rank | |||
Normal rank | |||
Revision as of 19:53, 19 March 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
