|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
12 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs |
Athanassopoulos, Stavros |
2008 |
45 | 3 |
p. 555-576 |
article |
|
| 2 | A Randomized Algorithm for Online Unit Clustering |
Chan, Timothy M. |
2007 |
45 | 3 |
p. 486-496 |
article |
|
| 3 | Competitive Online Multicommodity Routing |
Harks, Tobias |
2009 |
45 | 3 |
p. 533-554 |
article |
|
| 4 | Covering Many or Few Points with Unit Disks |
Berg, Mark de |
2008 |
45 | 3 |
p. 446-469 |
article |
|
| 5 | Network Design with Edge-Connectivity and Degree Constraints |
Fukunaga, Takuro |
2008 |
45 | 3 |
p. 512-532 |
article |
|
| 6 | On Hierarchical Diameter-Clustering and the Supplier Problem |
Das, Aparna |
2009 |
45 | 3 |
p. 497-511 |
article |
|
| 7 | Online Dynamic Programming Speedups |
Bar-Noy, Amotz |
2009 |
45 | 3 |
p. 429-445 |
article |
|
| 8 | Online k-Server Routing Problems |
Bonifaci, Vincenzo |
2008 |
45 | 3 |
p. 470-485 |
article |
|
| 9 | On the Black-Box Complexity of Sperner’s Lemma |
Friedl, Katalin |
2008 |
45 | 3 |
p. 629-646 |
article |
|
| 10 | Quantum Algorithms for Matching Problems |
Dörn, Sebastian |
2008 |
45 | 3 |
p. 613-628 |
article |
|
| 11 | The Complexity of Finding SUBSEQ(A) |
Fenner, Stephen |
2008 |
45 | 3 |
p. 577-612 |
article |
|
| 12 | WAOA 2006 Special Issue of TOCS |
Erlebach, Thomas |
2009 |
45 | 3 |
p. 427-428 |
article |
12 results found