𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation Algorithms for Dispersion Problems

✍ Scribed by Barun Chandra; Magnús M Halldórsson

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
182 KB
Volume
38
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for Directed St
Approximation Algorithms for Directed Steiner Problems
✍ Moses Charikar; Chandra Chekuri; To-yat Cheung; Zuo Dai; Ashish Goel; Sudipto Gu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 181 KB

We give the first non-trivial approximation algorithms for the Steiner tree problem and the generalized Steiner network problem on general directed graphs. These problems have several applications in network design and multicast routing.

Combinatorial Approximation Algorithms f
Combinatorial Approximation Algorithms for Generalized Flow Problems
✍ Jeffrey D Oldham 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier µ v w for each arc v w . For every unit of flow entering the arc, µ v w units of flow exit. We present a strongly polynomial algorithm for a single-source generalized shortest paths problem, usi

Improved Approximation Algorithms for Un
Improved Approximation Algorithms for Uniform Connectivity Problems
✍ Samir Khuller; Balaji Raghavachari 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 174 KB

The problem of finding minimum-weight spanning subgraphs with a given connectivity requirement is considered. The problem is NP-hard when the connectivity requirement is greater than one. Polynomial time approximation algorithms for various weighted and unweighted connectivity problems are given. Th

Approximation algorithms for shop schedu
Approximation algorithms for shop scheduling problems with minsum objective
✍ Maurice Queyranne; Maxim Sviridenko 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 166 KB

We consider a general class of multiprocessor shop scheduling problems, preemptive or non-preemptive, with precedence constraints between operations, with job or operation release dates, and with a class of objective functions including weighted sums of job, operations and stage completion times. We