| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An Approximation Algorithm for the Fault Tolerant Metric FacilityLocation Problem
|
Jain\thanks{One Microsoft Way, Redmond, WA 98007, USA. kamalj@microsoft.com., Kamal
|
|
2003
|
38 |
3 |
p. 433-439
|
artikel
|
| 2 |
An Approximation Algorithm for the Fault Tolerant Metric FacilityLocation Problem
|
Jain, Kamal
|
|
|
38 |
3 |
p. 433-439
|
artikel
|
| 3 |
Approximation Algorithms for a Capacitated Network Design Problem
|
Hassin, Refael
|
|
2003
|
38 |
3 |
p. 417-431
|
artikel
|
| 4 |
Approximation Algorithms for a Capacitated Network Design Problem
|
Hassin, Refael
|
|
|
38 |
3 |
p. 417-431
|
artikel
|
| 5 |
Guest Editors’ Introduction
|
Jansen, Klaus
|
|
2003
|
38 |
3 |
p. 415-416
|
artikel
|
| 6 |
Guest Editors’ Introduction
|
Jansen, Klaus
|
|
|
38 |
3 |
p. 415-416
|
artikel
|
| 7 |
Improved Approximations for Tour and Tree Covers
|
Könemann, Jochen
|
|
2003
|
38 |
3 |
p. 441-449
|
artikel
|
| 8 |
Improved Approximations for Tour and Tree Covers
|
Könemann, Jochen
|
|
|
38 |
3 |
p. 441-449
|
artikel
|
| 9 |
Inapproximability Results for Set Splitting and SatisfiabilityProblems with No Mixed Clauses
|
Guruswami, Venkatesan
|
|
2003
|
38 |
3 |
p. 451-469
|
artikel
|
| 10 |
Inapproximability Results for Set Splitting and SatisfiabilityProblems with No Mixed Clauses
|
Guruswami, Venkatesan
|
|
|
38 |
3 |
p. 451-469
|
artikel
|
| 11 |
Maximum Dispersion and Geometric Maximum Weight Cliques
|
Fekete, Sándor P.
|
|
2003
|
38 |
3 |
p. 501-511
|
artikel
|
| 12 |
Maximum Dispersion and Geometric Maximum Weight Cliques
|
Fekete, Sándor P.
|
|
|
38 |
3 |
p. 501-511
|
artikel
|
| 13 |
The Relative Complexity of Approximate Counting Problems
|
Dyer, Martin
|
|
2003
|
38 |
3 |
p. 471-500
|
artikel
|
Tijdschrift beschrijving