Theoretical Computer Science and General Issues

Experimental Algorithms

7th International Workshop, WEA 2008 Provincetown, MA, USA, May 30 - June 1, 2008 Proceedings

Editors: McGeoch, Catherine C. (Ed.)

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-540-68552-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $109.00
price for USA
  • ISBN 978-3-540-68548-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

The Workshop on Experimental Algorithms, WEA, is intended to be an int- national forum for research on the experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. The emphasis of the workshop is the use of experimental me- ods to guide the design, analysis, implementation, and evaluation of algorithms, heuristics, and optimization programs. WEA 2008 was held at the Provincetown Inn, Provincetown, MA, USA, on May 30 – June 1, 2008. This was the seventh workshop of the series, after Rome (2007),Menorca(2006),Santorini(2005),RiodeJaniero(2004),Asconia(2003), and Riga (2001). This volume contains all contributed papers accepted for presentation at the workshop. The 26 contributed papers were selected by the Program Committee onthebasisofatleastthreerefereereports,somecontributedbytrustedexternal referees. In addition to the 26 contributed papers, the program contained two invited talks. Camil Demetrescu, of the University of Rome “La Sapienza,” spoke on “Visualization in Algorithm Engineering.” David S. Johnson of AT & T Labs – Research, gave a talk on “Bin Packing: From Theory to Experiment and Back Again.” We would like to thank the authors who responded to the call for papers, our invited speakers, the members of the ProgramCommittee, the external referees, and the Organizing Committee members for making this workshop possible.

Table of contents (26 chapters)

  • Reducing Splaying by Taking Advantage of Working Sets

    Aho, Timo (et al.)

    Pages 1-13

  • Engineering Burstsort: Towards Fast In-Place String Sorting

    Sinha, Ranjan (et al.)

    Pages 14-27

  • Comparing Integer Data Structures for 32 and 64 Bit Keys

    Nash, Nicholas (et al.)

    Pages 28-42

  • A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems

    Clautiaux, François (et al.)

    Pages 43-54

  • Layer-Free Upward Crossing Minimization

    Chimani, Markus (et al.)

    Pages 55-68

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-540-68552-4
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $109.00
price for USA
  • ISBN 978-3-540-68548-7
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Experimental Algorithms
Book Subtitle
7th International Workshop, WEA 2008 Provincetown, MA, USA, May 30 - June 1, 2008 Proceedings
Editors
  • Catherine C. McGeoch
Series Title
Theoretical Computer Science and General Issues
Series Volume
5038
Copyright
2008
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-68552-4
DOI
10.1007/978-3-540-68552-4
Softcover ISBN
978-3-540-68548-7
Edition Number
1
Number of Pages
X, 363
Topics