Approximation and Online Algorithms - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

26

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540695134, 9783540695141

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11970125_21 ◽

2007 ◽

pp. 265-278

Author(s):

Jörg Knoche ◽

Piotr Krysta

Keyword(s):

Experimental Study ◽

Combinatorial Auctions

Download Full-text

Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11970125_23 ◽

2007 ◽

pp. 290-301 ◽

Author(s):

Asaf Levin

Keyword(s):

Local Search ◽

Set Cover ◽

Set Cover Problem ◽

Download Full-text

The k-Allocation Problem and Its Variants

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11970125_20 ◽

2007 ◽

pp. 253-264 ◽

Author(s):

Dorit S. Hochbaum ◽

Asaf Levin

Keyword(s):

Allocation Problem

Download Full-text

Coping with Interference: From Maximum Coverage to Planning Cellular Networks

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11970125_3 ◽

2007 ◽

pp. 29-42 ◽

Author(s):

David Amzallag ◽

Joseph (Seffi) Naor ◽

Danny Raz

Keyword(s):

Cellular Networks ◽

Maximum Coverage

Download Full-text

Approximation Algorithms for Multi-criteria Traveling Salesman Problems

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11970125_24 ◽

2007 ◽

pp. 302-315 ◽

Author(s):

Bodo Manthey ◽

L. Shankar Ram

Keyword(s):

Approximation Algorithms ◽

Traveling Salesman ◽

Traveling Salesman Problems

Download Full-text

Competitive Online Multicommodity Routing

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11970125_19 ◽

2007 ◽

pp. 240-252 ◽

Author(s):

Tobias Harks ◽

Stefan Heinz ◽

Marc E. Pfetsch

Download Full-text

Improved Approximation Bounds for Edge Dominating Set in Dense Graphs

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11970125_9 ◽

2007 ◽

pp. 108-120 ◽

Author(s):

Jean Cardinal ◽

Stefan Langerman ◽

Eythan Levy

Keyword(s):

Dominating Set ◽

Edge Dominating Set ◽

Download Full-text

Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11970125_17 ◽

2007 ◽

pp. 214-225 ◽

Author(s):

Gregory Gutin ◽

Boris Goldengorin ◽

Jing Huang

Keyword(s):

Case Analysis ◽

Traveling Salesman ◽

Worst Case Analysis ◽

Traveling Salesman Problems ◽

Download Full-text

A Randomized Algorithm for Online Unit Clustering

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11970125_10 ◽

2007 ◽

pp. 121-131 ◽

Author(s):

Timothy M. Chan ◽

Hamid Zarrabi-Zadeh

Keyword(s):

Randomized Algorithm

Download Full-text

Covering Many or Few Points with Unit Disks

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11970125_5 ◽

2007 ◽

pp. 55-68 ◽

Author(s):

Mark de Berg ◽

Sergio Cabello ◽

Sariel Har-Peled

Keyword(s):

Download Full-text