Advertisement

Experimental Algorithms

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

  • Editors
  • Camil Demetrescu
Conference proceedings WEA 2007

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

Table of contents

  1. Front Matter
  2. Invited Lectures

    1. Corinna Cortes, Mehryar Mohri, Ashish Rastogi
      Pages 1-22
    2. Peter Sanders, Dominik Schultes
      Pages 23-36
  3. Session 1 (Route Planning)

    1. Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck
      Pages 38-51
    2. Daniel Delling, Dorothea Wagner
      Pages 52-65
    3. Dominik Schultes, Peter Sanders
      Pages 66-79
  4. Session 2 (Dynamic Trees, Skip Lists, and Bloom Filters)

    1. Robert E. Tarjan, Renato F. Werneck
      Pages 80-93
    2. Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia
      Pages 94-107
    3. Felix Putze, Peter Sanders, Johannes Singler
      Pages 108-121
  5. Session 3 (Crossing Minimizationm, TSP, and Vehicle Routing)

    1. Olca A. Çakıroḡlu, Cesim Erten, Ömer Karataş, Melih Sözdinler
      Pages 122-135
    2. Vladimir Deineko, Alexander Tiskin
      Pages 136-149
    3. Artur Pessoa, Marcus Poggi de Aragão, Eduardo Uchoa
      Pages 150-160
  6. Session 4 (Network Routing and Stability)

    1. Marcelo Santos, Lúcia M. A. Drummond, Eduardo Uchoa
      Pages 175-188
    2. Maria Chroni, Dimitrios Koukopoulos, Stavros D. Nikolopoulos
      Pages 189-202
  7. Session 5 (Strings and Range Searching)

    1. Kimmo Fredriksson, Fedor Nikitin
      Pages 203-216
    2. Niko Välimäki, Wolfgang Gerlach, Kashyap Dixit, Veli Mäkinen
      Pages 217-228
    3. Karina Figueroa, Kimmo Fredriksson
      Pages 229-241
  8. Session 6 (Matching, Flows, and Spanners)

    1. Jens Maue, Peter Sanders
      Pages 242-255
    2. Maxim Babenko, Jonathan Derryberry, Andrew Goldberg, Robert Tarjan, Yunhong Zhou
      Pages 256-269
    3. Mohammad Farshi, Joachim Gudmundsson
      Pages 270-284
  9. Session 7 (Covering, Coloring, and Partitioning)

    1. Eyjolfur Asgeirsson, Cliff Stein
      Pages 285-296
    2. Falk Hüffner, Nadja Betzler, Rolf Niedermeier
      Pages 297-310
    3. Ekaterina Smorodkina, Mayur Thakur, Daniel Tauritz
      Pages 311-323
  10. Session 8 (Applications)

    1. Angelo Fanelli, Michele Flammini, Domenico Mango, Giovanna Melideo, Luca Moscardelli
      Pages 324-337
    2. Friedrich Eisenbrand, Andreas Karrenbauer, Chihao Xu
      Pages 338-351
    3. Fei Ye, Yan Guo, Andrew Lawson, Jijun Tang
      Pages 352-364
  11. Session 9 (Spanning Trees)

    1. Christian Liebchen, Gregor Wünsch, Ekkehard Köhler, Alexander Reich, Romeo Rizzi
      Pages 365-378
    2. Markus Behle, Michael Jünger, Frauke Liers
      Pages 379-392
  12. Session 10 (Packing and Auctions)

    1. Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten
      Pages 406-419
    2. Ernst Althaus, Tobias Baumann, Elmar Schömer, Kai Werth
      Pages 420-432
    3. Dries R. Goossens, Frits C. R. Spieksma
      Pages 433-445
  13. Back Matter

About these proceedings

Introduction

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.

Keywords

Simulation algorithm algorithmic mathematics algorithmics algorithms algorithms analysis algorithms design algorithms engineering algorithms implementation approximation algorithms calculus combinatorial mathematics combinatorial optimization cryptography optimization

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-72845-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2007
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-72844-3
  • Online ISBN 978-3-540-72845-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Pharma
Automotive
Chemical Manufacturing
Biotechnology
Electronics
IT & Software
Telecommunications
Aerospace
Engineering