✦ LIBER ✦

Approximating disjoint-path problems using packing integer programs

✍ Scribed by Stavros G. Kolliopoulos; Clifford Stein

Publisher: Springer-Verlag
Year: 2004
Tongue: English
Weight: 247 KB
Volume: 99
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-002-0370-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Probabilistic construction of determinis

Probabilistic construction of deterministic algorithms: Approximating packing integer programs

✍ Prabhakar Raghavan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 796 KB

Approximate solution of parametric integ

Approximate solution of parametric integer programming problems

✍ N. V. Filonenko 📂 Article 📅 1980 🏛 Springer US 🌐 English ⚖ 430 KB

Approximations for the Disjoint Paths Pr

Approximations for the Disjoint Paths Problem in High-Diameter Planar Networks

✍ Jon Kleinberg; Éva Tardos 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 512 KB

We consider the problem of connecting distinguished terminal pairs in a graph via edge-disjoint paths. This is a classical NP-complete problem for which no general approximation techniques are known; it has recently been brought into focus in papers discussing applications to admission control in hi

Integer programming problems with inexac

Integer programming problems with inexact data: Exact and approximate solutions

✍ I. V. Sergienko; N. V. Semenova 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 571 KB

Integer programming formulations for the

Integer programming formulations for the two 4-hop-constrained paths problem

✍ David Huygens; A. Ridha Mahjoub 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

The complexity of approximate algorithms

The complexity of approximate algorithms for the problem of integer programming

✍ N.N. Kuzyurin 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 334 KB