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

The k-Allocation Problem and Its Variants

2007 ◽  
pp. 253-264 ◽  
Author(s):  
Dorit S. Hochbaum ◽  
Asaf Levin
Keyword(s):  
Allocation Problem

Coping with Interference: From Maximum Coverage to Planning Cellular Networks

2007 ◽  
pp. 29-42 ◽  
Author(s):  
David Amzallag ◽  
Joseph (Seffi) Naor ◽  
Danny Raz
Keyword(s):  
Cellular Networks ◽  
Maximum Coverage

scholarly journals Competitive Online Multicommodity Routing

2007 ◽  
pp. 240-252 ◽  
Author(s):  
Tobias Harks ◽  
Stefan Heinz ◽  
Marc E. Pfetsch

Covering Many or Few Points with Unit Disks

2007 ◽  
pp. 55-68 ◽  
Author(s):  
Mark de Berg ◽  
Sergio Cabello ◽  
Sariel Har-Peled
Keyword(s):  
Unit Disks

scholarly journals Improved Online Hypercube Packing

2007 ◽  
pp. 226-239 ◽  
Author(s):  
Xin Han ◽  
Deshi Ye ◽  
Yong Zhou

Improved Approximation Bounds for Edge Dominating Set in Dense Graphs

2007 ◽  
pp. 108-120 ◽  
Author(s):  
Jean Cardinal ◽  
Stefan Langerman ◽  
Eythan Levy
Keyword(s):  
Dominating Set ◽  
Edge Dominating Set ◽  
Dense Graphs
Load More ...
Sign in / Sign up

Export Citation Format

Share Document