Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints (Q4925249): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_30 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1487455319 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:17, 20 March 2024
scientific article; zbMATH DE number 6174166
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints |
scientific article; zbMATH DE number 6174166 |
Statements
Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints (English)
0 references
11 June 2013
0 references
\(k\)-disjoint bi-constraint path
0 references
NP-hard
0 references
bifactor approximation algorithm
0 references
auxiliary graph
0 references
cycle cancellation
0 references
