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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540779179, 9783540779186

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Improved Lower Bounds for Non-utilitarian Truthfulness

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77918-6_2 ◽

2008 ◽

pp. 15-26 ◽

Cited By ~ 3

Author(s):

Iftah Gamzu

Keyword(s):

Lower Bounds

Download Full-text

On Min-Max r-Gatherings

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77918-6_11 ◽

2008 ◽

pp. 128-141

Author(s):

Amitai Armon

Download Full-text

Full and Local Information in Distributed Decision Making

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77918-6_13 ◽

2008 ◽

pp. 156-169

Author(s):

Panagiota N. Panagopoulou ◽

Paul G. Spirakis

Keyword(s):

Decision Making ◽

Local Information ◽

Distributed Decision Making ◽

Distributed Decision

Download Full-text

Covering the Edges of Bipartite Graphs Using K 2,2 Graphs

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77918-6_10 ◽

2008 ◽

pp. 116-127

Author(s):

Dorit S. Hochbaum ◽

Asaf Levin

Keyword(s):

Bipartite Graphs

Download Full-text

Minimum Weighted Sum Bin Packing

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77918-6_18 ◽

2008 ◽

pp. 218-231

Author(s):

Leah Epstein ◽

Asaf Levin

Keyword(s):

Bin Packing ◽

Weighted Sum

Download Full-text

Geometric Spanners with Small Chromatic Number

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77918-6_7 ◽

2008 ◽

pp. 75-88

Author(s):

Prosenjit Bose ◽

Paz Carmi ◽

Mathieu Couture ◽

Anil Maheshwari ◽

Michiel Smid ◽

...

Keyword(s):

Chromatic Number ◽

Geometric Spanners

Download Full-text

Buyer-Supplier Games: Optimization over the Core

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77918-6_3 ◽

2008 ◽

pp. 27-40

Author(s):

Nedialko B. Dimitrov ◽

C. Greg Plaxton

Keyword(s):

The Core

Download Full-text

On the Max Coloring Problem

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77918-6_12 ◽

2008 ◽

pp. 142-155 ◽

Cited By ~ 6

Author(s):

Leah Epstein ◽

Asaf Levin

Keyword(s):

Coloring Problem

Download Full-text

Better Bounds for Incremental Medians

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77918-6_17 ◽

2008 ◽

pp. 207-217 ◽

Cited By ~ 1

Author(s):

Marek Chrobak ◽

Mathilde Hurand

Download Full-text

The Minimum Substring Cover Problem

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77918-6_14 ◽

2008 ◽

pp. 170-183 ◽

Cited By ~ 2

Author(s):

Danny Hermelin ◽

Dror Rawitz ◽

Romeo Rizzi ◽

Stéphane Vialette

Keyword(s):

Cover Problem

Download Full-text

Approximation and Online Algorithms - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Improved Lower Bounds for Non-utilitarian Truthfulness

On Min-Max r-Gatherings

Full and Local Information in Distributed Decision Making

Covering the Edges of Bipartite Graphs Using K 2,2 Graphs

Minimum Weighted Sum Bin Packing

Geometric Spanners with Small Chromatic Number

Buyer-Supplier Games: Optimization over the Core

On the Max Coloring Problem

Better Bounds for Incremental Medians

The Minimum Substring Cover Problem

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