Algorithms – ESA 2005 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

78

(FIVE YEARS 0)

H-INDEX

15

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540291183, 9783540319511

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Bucket Game with Applications to Set Multicover and Dynamic Page Migration

Algorithms – ESA 2005 - Lecture Notes in Computer Science ◽

10.1007/11561071_72 ◽

2005 ◽

pp. 815-826 ◽

Author(s):

Marcin Bienkowski ◽

Jarosław Byrka

Keyword(s):

Download Full-text

Using Fractional Primal-Dual to Schedule Split Intervals with Demands

Algorithms – ESA 2005 - Lecture Notes in Computer Science ◽

10.1007/11561071_63 ◽

2005 ◽

pp. 714-725 ◽

Author(s):

Reuven Bar-Yehuda ◽

Dror Rawitz

Keyword(s):

Download Full-text

Designing Reliable Algorithms in Unreliable Memories

Algorithms – ESA 2005 - Lecture Notes in Computer Science ◽

10.1007/11561071_1 ◽

2005 ◽

pp. 1-8 ◽

Author(s):

Irene Finocchi ◽

Fabrizio Grandoni ◽

Giuseppe F. Italiano

Download Full-text

Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines

Algorithms – ESA 2005 - Lecture Notes in Computer Science ◽

10.1007/11561071_55 ◽

2005 ◽

pp. 616-627 ◽

Author(s):

Annamária Kovács

Keyword(s):

Approximation Algorithm ◽

Related Machines

Download Full-text

A 2-Approximation Algorithm for Sorting by Prefix Reversals

Algorithms – ESA 2005 - Lecture Notes in Computer Science ◽

10.1007/11561071_38 ◽

2005 ◽

pp. 415-425 ◽

Author(s):

Johannes Fischer ◽

Simon W. Ginzinger

Keyword(s):

Approximation Algorithm

Download Full-text

Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack

Algorithms – ESA 2005 - Lecture Notes in Computer Science ◽

10.1007/11561071_76 ◽

2005 ◽

pp. 862-873 ◽

Author(s):

Hassene Aissi ◽

Cristina Bazgan ◽

Daniel Vanderpooten

Keyword(s):

Shortest Path ◽

Spanning Tree ◽

Approximation Complexity

Download Full-text

Efficient Approximation Schemes for Geometric Problems?

Algorithms – ESA 2005 - Lecture Notes in Computer Science ◽

10.1007/11561071_41 ◽

2005 ◽

pp. 448-459 ◽

Author(s):

Dániel Marx

Keyword(s):

Approximation Schemes ◽

Geometric Problems ◽

Efficient Approximation

Download Full-text

Experimental Study of Geometric t-Spanners

Algorithms – ESA 2005 - Lecture Notes in Computer Science ◽

10.1007/11561071_50 ◽

2005 ◽

pp. 556-567 ◽

Author(s):

Mohammad Farshi ◽

Joachim Gudmundsson

Keyword(s):

Experimental Study

Download Full-text

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions

Algorithms – ESA 2005 - Lecture Notes in Computer Science ◽

10.1007/11561071_11 ◽

2005 ◽

pp. 95-106 ◽

Author(s):

Frederic Dorn ◽

Eelko Penninkx ◽

Hans L. Bodlaender ◽

Fedor V. Fomin

Keyword(s):

Planar Graphs ◽

Exact Algorithms ◽

Branch Decompositions

Download Full-text

Optimizing a 2D Function Satisfying Unimodality Properties

Algorithms – ESA 2005 - Lecture Notes in Computer Science ◽

10.1007/11561071_78 ◽

2005 ◽

pp. 887-898 ◽

Author(s):

Erik D. Demaine ◽

Stefan Langerman

Download Full-text