Skip to main content
SpringerLink
Log in

Experimental and Efficient Algorithms

Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings

  • Conference proceedings
  • © 2003

Overview

Editors:
  1. Klaus Jansen

    1. Institute of Computer Science and Applied Mathematics, University of Kiel, Kiel, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Marian Margraf

    1. Institute of Computer Science and Applied Mathematics, University of Kiel, Kiel, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Monaldo Mastrolilli

    1. IDISIA - Instituto Dalle Molle di Studi sull’Intelligenza Artificiale, Manno, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. José D. P. Rolim

    1. Université de Genève 4, Switzerland

    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 2647)

Included in the following conference series:

Conference proceedings info: WEA 2003.

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 (22 papers)

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  2. Improving Linear Programming Approaches for the Steiner Tree Problem

    • Ernst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand
    Pages 1-14

  3. Algorithms and Experiments on Colouring Squares of Planar Graphs

    • Maria I. Andreou, Sotiris E. Nikoletseas, Paul G. Spirakis
    Pages 15-32

  4. Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem

    • Vittorio Bilò, Michele Flammini, Roberto Giovannelli
    Pages 33-46

  5. Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm

    • Domenico Cantone, Simone Faro
    Pages 47-58

  6. An On-Line Algorithm for the Rectangle Packing Problem with Rejection

    • Massimiliano Caramia, Stefano Giordan, Antonio Iovanella
    Pages 59-69

  7. New Lower and Upper Bounds for Graph Treewidth

    • François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre
    Pages 70-80

  8. Search Data Structures for Skewed Strings

    • Pilu Crescenzi, Roberto Grossi, Giuseppe F. Italiano
    Pages 81-96

  9. Evaluation of Basic Protocols for Optical Smart Dust Networks

    • Josep Díaz, Jordi Petit, Maria Serna
    Pages 97-106

  10. Linear Time Local Improvements for Weighted Matchings in Graphs

    • Doratha E. Drake, Stefan Hougardy
    Pages 107-119

  11. Experimental Studies of Graph Traversal Algorithms

    • Rudolf Fleischer, Gerhard Trippen
    Pages 120-133

  12. A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning

    • Kārlis Freivalds
    Pages 134-147

  13. Comparing Push- and Pull-Based Broadcasting

    • Alexander Hall, Hanjo Täubig
    Pages 148-164

  14. Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility Location

    • Martin Hoefer
    Pages 165-178

  15. A Lazy Version of Eppstein’s K Shortest Paths Algorithm

    • Víctor M. Jiménez, Andrés Marzal
    Pages 179-191

  16. Linear Algorithm for 3-Coloring of Locally Connected Graphs

    • Martin Kochol
    Pages 191-194

  17. A Clustering Algorithm for Interval Graph Test on Noisy Data

    • Wei-Fu Lu, Wen-Lian Hsu
    Pages 195-208

  18. Core Instances for Testing: A Case Study

    • Monaldo Mastrolilli, Leonora Bianchi
    Pages 209-222

  19. The Reliable Algorithmic Software Challenge RASC

    • Kurt Mehlhorn
    Pages 222-222

  20. A New Class of Greedy Heuristics for Job Shop Scheduling Problems

    • Marco Pranzo, Carlo Meloni, Dario Pacciarelli
    Pages 223-236
Back to top

Keywords

About this book

 This book constitutes the refereed proceedings of the Second International Workshop on Experimental and Efficient Algorithms, WEA 2003, held in Ascona, Switzerland in May 2003.

The 19 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from 40 submissions. The focus of the volume is on applications of efficient algorithms for combinatorial problems.

Editors and Affiliations

  • Institute of Computer Science and Applied Mathematics, University of Kiel, Kiel, Germany

    Klaus Jansen, Marian Margraf

  • IDISIA - Instituto Dalle Molle di Studi sull’Intelligenza Artificiale, Manno, Switzerland

    Monaldo Mastrolilli

  • Université de Genève 4, Switzerland

    José D. P. Rolim

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation