Experimental Algorithms - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

33

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540728443

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Engineering Algorithms for Approximate Weighted Matching

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-72845-0_19 ◽

2007 ◽

pp. 242-255 ◽

Author(s):

Jens Maue ◽

Peter Sanders

Keyword(s):

Weighted Matching

Download Full-text

Simple Compression Code Supporting Random Access and Fast String Matching

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-72845-0_16 ◽

2007 ◽

pp. 203-216 ◽

Author(s):

Kimmo Fredriksson ◽

Fedor Nikitin

Keyword(s):

String Matching ◽

Random Access ◽

Simple Compression

Download Full-text

Dynamic Highway-Node Routing

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-72845-0_6 ◽

2007 ◽

pp. 66-79 ◽

Author(s):

Dominik Schultes ◽

Peter Sanders

Keyword(s):

Download Full-text

An Efficient Implementation for the 0-1 Multi-objective Knapsack Problem

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-72845-0_31 ◽

2007 ◽

pp. 406-419 ◽

Author(s):

Cristina Bazgan ◽

Hadrien Hugot ◽

Daniel Vanderpooten

Keyword(s):

Knapsack Problem ◽

Efficient Implementation ◽

Multi Objective

Download Full-text

On the Cost of Persistence and Authentication in Skip Lists

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-72845-0_8 ◽

2007 ◽

pp. 94-107 ◽

Author(s):

Michael T. Goodrich ◽

Charalampos Papamanthou ◽

Roberto Tamassia

Keyword(s):

Download Full-text

Random Models for Geometric Graphs (Abstract)

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-72845-0_3 ◽

2007 ◽

pp. 37-37

Author(s):

Maria Serna

Keyword(s):

Geometric Graphs ◽

Download Full-text

Vertex Cover Approximations on Random Graphs

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-72845-0_22 ◽

2007 ◽

pp. 285-296 ◽

Author(s):

Eyjolfur Asgeirsson ◽

Cliff Stein

Keyword(s):

Random Graphs ◽

Download Full-text

A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-72845-0_29 ◽

2007 ◽

pp. 379-392 ◽

Author(s):

Markus Behle ◽

Michael Jünger ◽

Frauke Liers

Keyword(s):

Spanning Tree ◽

Minimum Spanning Tree ◽

Branch And Cut ◽

Minimum Spanning Tree Problem

Download Full-text

An Alternative Ranking Problem for Search Engines

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-72845-0_1 ◽

2007 ◽

pp. 1-22 ◽

Author(s):

Corinna Cortes ◽

Mehryar Mohri ◽

Ashish Rastogi

Keyword(s):

Search Engines ◽

Ranking Problem ◽

Alternative Ranking

Download Full-text

Simple Space-Time Trade-Offs for AESA

Experimental Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-72845-0_18 ◽

2007 ◽

pp. 229-241 ◽

Author(s):

Karina Figueroa ◽

Kimmo Fredriksson

Keyword(s):

Download Full-text