Approximating disjoint-path problems using packing integer programs (Q1424288)
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: Approximating disjoint-path problems using packing integer programs |
scientific article; zbMATH DE number 2055182
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating disjoint-path problems using packing integer programs |
scientific article; zbMATH DE number 2055182 |
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
0.9464464
0 references
0.9099561
0 references
0.9005262
0 references
0.8900254
0 references
0.8900254
0 references
0.8898362
0 references
0 references
