Skip to main content
SpringerLink
Log in
Book cover

Experimental Algorithms

6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Camil Demetrescu
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4525)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: WEA 2007.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (33 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Lectures

    1. An Alternative Ranking Problem for Search Engines

      • Corinna Cortes, Mehryar Mohri, Ashish Rastogi
      Pages 1-22

    2. Engineering Fast Route Planning Algorithms

      • Peter Sanders, Dominik Schultes
      Pages 23-36

    3. Random Models for Geometric Graphs (Abstract)

      • Maria Serna
      Pages 37-37

  3. Session 1 (Route Planning)

    1. Better Landmarks Within Reach

      • Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
      Pages 38-51

    2. Landmark-Based Routing in Dynamic Graphs

      • Daniel Delling, Dorothea Wagner
      Pages 52-65

    3. Dynamic Highway-Node Routing

      • Dominik Schultes, Peter Sanders
      Pages 66-79

  4. Session 2 (Dynamic Trees, Skip Lists, and Bloom Filters)

    1. Dynamic Trees in Practice

      • Robert E. Tarjan, Renato F. Werneck
      Pages 80-93

    2. On the Cost of Persistence and Authentication in Skip Lists

      • Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia
      Pages 94-107

    3. Cache-, Hash- and Space-Efficient Bloom Filters

      • Felix Putze, Peter Sanders, Johannes Singler
      Pages 108-121

  5. Session 3 (Crossing Minimizationm, TSP, and Vehicle Routing)

    1. Crossing Minimization in Weighted Bipartite Graphs

      • Olca A. Çakıroḡlu, Cesim Erten, Ömer KarataÅŸ, Melih Sözdinler
      Pages 122-135

    2. Fast Minimum-Weight Double-Tree Shortcutting for Metric TSP

      • Vladimir Deineko, Alexander Tiskin
      Pages 136-149

    3. A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem

      • Artur Pessoa, Marcus Poggi de Aragão, Eduardo Uchoa
      Pages 150-160

  6. Session 4 (Network Routing and Stability)

    1. Simple and Efficient Geographic Routing Around Obstacles for Wireless Sensor Networks

      • Olivier Powell, Sotiris Nikoletseas
      Pages 161-174

    2. A Distributed Primal-Dual Heuristic for Steiner Problems in Networks

      • Marcelo Santos, Lúcia M. A. Drummond, Eduardo Uchoa
      Pages 175-188

    3. An Experimental Study of Stability in Heterogeneous Networks

      • Maria Chroni, Dimitrios Koukopoulos, Stavros D. Nikolopoulos
      Pages 189-202

  7. Session 5 (Strings and Range Searching)

    1. Simple Compression Code Supporting Random Access and Fast String Matching

      • Kimmo Fredriksson, Fedor Nikitin
      Pages 203-216

    2. Engineering a Compressed Suffix Tree Implementation

      • Niko Välimäki, Wolfgang Gerlach, Kashyap Dixit, Veli Mäkinen
      Pages 217-228

    3. Simple Space-Time Trade-Offs for AESA

      • Karina Figueroa, Kimmo Fredriksson
      Pages 229-241

  8. Session 6 (Matching, Flows, and Spanners)

    1. Engineering Algorithms for Approximate Weighted Matching

      • Jens Maue, Peter Sanders
      Pages 242-255
Back to top

Keywords

About this book

This book constitutes the refereed proceedings of the 6th International Workshop on Experimental and Efficient Algorithms, WEA 2007, held in Rome, Italy, in June 2007.

The 30 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 121 submissions. Fostering and disseminating high quality research results focused on the experimental analysis of algorithms the papers are devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, data mining, simulation, cryptography and security, scheduling, searching, sorting, string matching, coding, networking, etc.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation