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

9783642291159, 9783642291166

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29116-6_7 ◽

2012 ◽

pp. 77-88 ◽

Cited By ~ 4

Author(s):

Nadine Schwartges ◽

Joachim Spoerhase ◽

Alexander Wolff

Keyword(s):

Approximation Algorithms ◽

Spanning Tree

Download Full-text

Faster and Simpler Approximation of Stable Matchings

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29116-6_15 ◽

2012 ◽

pp. 176-187 ◽

Cited By ~ 2

Author(s):

Katarzyna Paluch

Keyword(s):

Stable Matchings

Download Full-text

Competitive Router Scheduling with Structured Data

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29116-6_19 ◽

2012 ◽

pp. 219-232 ◽

Cited By ~ 3

Author(s):

Yishay Mansour ◽

Boaz Patt-Shamir ◽

Dror Rawitz

Keyword(s):

Structured Data

Download Full-text

A New Perspective on List Update: Probabilistic Locality and Working Set

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29116-6_13 ◽

2012 ◽

pp. 150-163 ◽

Cited By ~ 1

Author(s):

Reza Dorrigiv ◽

Alejandro López-Ortiz

Keyword(s):

List Update ◽

Working Set ◽

New Perspective

Download Full-text

On Online Algorithms with Advice for the k-Server Problem

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29116-6_17 ◽

2012 ◽

pp. 198-210 ◽

Cited By ~ 16

Author(s):

Marc P. Renault ◽

Adi Rosén

Keyword(s):

Online Algorithms ◽

Server Problem

Download Full-text

Generalized Maximum Flows over Time

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29116-6_21 ◽

2012 ◽

pp. 247-260 ◽

Cited By ~ 4

Author(s):

Martin Groß ◽

Martin Skutella

Keyword(s):

Maximum Flows ◽

Flows Over Time ◽

Over Time

Download Full-text

Simpler 3/4-Approximation Algorithms for MAX SAT

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29116-6_16 ◽

2012 ◽

pp. 188-197 ◽

Cited By ~ 5

Author(s):

Anke van Zuylen

Keyword(s):

Approximation Algorithms ◽

Max Sat

Download Full-text

Parameterized Approximation Algorithms for Hitting Set

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29116-6_6 ◽

2012 ◽

pp. 63-76 ◽

Cited By ~ 4

Author(s):

Ljiljana Brankovic ◽

Henning Fernau

Keyword(s):

Approximation Algorithms ◽

Hitting Set

Download Full-text

An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29116-6_4 ◽

2012 ◽

pp. 35-48 ◽

Cited By ~ 4

Author(s):

Wolfgang Bein ◽

Naoki Hatta ◽

Nelson Hernandez-Cons ◽

Hiro Ito ◽

Shoji Kasahara ◽

...

Keyword(s):

Power Management ◽

Online Algorithm ◽

Management Problems ◽

Self Tuning

Download Full-text

Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems

Approximation and Online Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29116-6_20 ◽

2012 ◽

pp. 233-246 ◽

Cited By ~ 1

Author(s):

Cristina Bazgan ◽

Laurent Gourvès ◽

Jérôme Monnot

Keyword(s):

Fixed Number ◽

Number Of Solutions

Download Full-text

Approximation and Online Algorithms - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs

Faster and Simpler Approximation of Stable Matchings

Competitive Router Scheduling with Structured Data

A New Perspective on List Update: Probabilistic Locality and Working Set

On Online Algorithms with Advice for the k-Server Problem

Generalized Maximum Flows over Time

Simpler 3/4-Approximation Algorithms for MAX SAT

Parameterized Approximation Algorithms for Hitting Set

An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems

Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems

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