Approximating disjoint-path problems using packing integer programs (Q1424288): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Clifford Stein / rank | |||
| Property / author | |||
| Property / author: Clifford Stein / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:17, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating disjoint-path problems using packing integer programs |
scientific article |
Statements
Approximating disjoint-path problems using packing integer programs (English)
0 references
11 March 2004
0 references
This paper is on approximating disjoint path problems by using polynomial-size packing integer programs. Some look-better polynomial algorithms are designed particularly for the colomn restricted programs which are introduced by the authors.
0 references
approximation algorithm
0 references
packing integer program
0 references
edge-disjoint path
0 references
