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

9783540322078, 9783540322085

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11671411_13 ◽

2006 ◽

pp. 161-175 ◽

Cited By ~ 23

Author(s):

Dimitris Fotakis ◽

Spyros Kontogiannis ◽

Paul Spirakis

Keyword(s):

Congestion Games ◽

Network Congestion ◽

Pure Equilibria

Download Full-text

Approximation and Complexity of k–Splittable Flows

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11671411_19 ◽

2006 ◽

pp. 244-257 ◽

Cited By ~ 6

Author(s):

Ronald Koch ◽

Martin Skutella ◽

Ines Spenke

Download Full-text

Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11671411_12 ◽

2006 ◽

pp. 147-160 ◽

Cited By ~ 1

Author(s):

A. Ferrante ◽

G. Parlato ◽

F. Sorrentino ◽

C. Ventre

Keyword(s):

Selfish Agents

Download Full-text

Speed Scaling of Tasks with Precedence Constraints

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11671411_24 ◽

2006 ◽

pp. 307-319 ◽

Cited By ~ 6

Author(s):

Kirk Pruhs ◽

Rob van Stee ◽

Patchrawat Uthaisombut

Keyword(s):

Precedence Constraints ◽

Speed Scaling

Download Full-text

Deterministic Online Optical Call Admission Revisited

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11671411_15 ◽

2006 ◽

pp. 190-202 ◽

Cited By ~ 1

Author(s):

Elisabeth Gassner ◽

Sven O. Krumke

Keyword(s):

Call Admission

Download Full-text

A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11671411_23 ◽

2006 ◽

pp. 296-306 ◽

Cited By ~ 28

Author(s):

Tim Nieberg ◽

Johann Hurink

Keyword(s):

Unit Disk ◽

Dominating Set ◽

Minimum Dominating Set ◽

Unit Disk Graphs ◽

Dominating Set Problem

Download Full-text

Rounding of Sequences and Matrices, with Applications

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11671411_8 ◽

2006 ◽

pp. 96-109 ◽

Cited By ~ 1

Author(s):

Benjamin Doerr ◽

Tobias Friedrich ◽

Christian Klein ◽

Ralf Osbild

Download Full-text

Partial Multicuts in Trees

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11671411_25 ◽

2006 ◽

pp. 320-333 ◽

Cited By ~ 9

Author(s):

Asaf Levin ◽

Danny Segev

Download Full-text

The Conference Call Search Problem in Wireless Networks

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11671411_11 ◽

2006 ◽

pp. 133-146 ◽

Cited By ~ 1

Author(s):

Leah Epstein ◽

Asaf Levin

Keyword(s):

Wireless Networks ◽

Search Problem ◽

Conference Call

Download Full-text

A Better-Than-Greedy Algorithm for k-Set Multicover

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/11671411_14 ◽

2006 ◽

pp. 176-189 ◽

Cited By ~ 2

Author(s):

Toshihiro Fujito ◽

Hidekazu Kurahashi

Keyword(s):

Greedy Algorithm ◽

Better Than

Download Full-text

Approximation and Online Algorithms - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost

Approximation and Complexity of k–Splittable Flows

Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents

Speed Scaling of Tasks with Precedence Constraints

Deterministic Online Optical Call Admission Revisited

A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs

Rounding of Sequences and Matrices, with Applications

Partial Multicuts in Trees

The Conference Call Search Problem in Wireless Networks

A Better-Than-Greedy Algorithm for k-Set Multicover

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