Blick ins Buch

Experimental Algorithms

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

Catherine C. McGeoch (Herausgeber)

Buch | Softcover

X, 363 Seiten

2008 | 2008
Springer Berlin (Verlag)
978-3-540-68548-7 (ISBN)

Lese- und Medienproben

Blick ins Buch (midvox)

Artikel merken

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.

Reducing Splaying by Taking Advantage of Working Sets.- Engineering Burstsort: Towards Fast In-Place String Sorting.- Comparing Integer Data Structures for 32 and 64 Bit Keys.- A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems.- Layer-Free Upward Crossing Minimization.- On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations.- Computing Branch Decomposition of Large Planar Graphs.- Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem.- Computing Multiple Watchman Routes.- Engineering Parallel In-Place Random Generation of Integer Permutations.- Parallel Partition Revisited.- Broadword Implementation of Rank/Select Queries.- Efficient Implementations of Heuristics for Routing and Wavelength Assignment.- Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games.- When to Reap and When to Sow - Lowering Peak Usage with Realistic Batteries.- Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design.- Fast Local Search for the Maximum Independent Set Problem.- Optimal University Course Timetables and the Partial Transversal Polytope.- A Basic Toolbox for Constrained Quadratic 0/1 Optimization.- Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to Theory.- Reconstructing Phylogenetic Networks with One Recombination.- Exact Algorithms for Cluster Editing: Evaluation and Experiments.- Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm.- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.- Bidirectional A ??? Search for Time-Dependent Fast Paths.- Multi-criteria Shortest Paths in Time-Dependent Train Networks.

Erscheint lt. Verlag	8.5.2008
Reihe/Serie	Lecture Notes in Computer Science
Reihe/Serie	Theoretical Computer Science and General Issues
Zusatzinfo	X, 363 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	581 g
Themenwelt	Mathematik / Informatik ► Informatik ► Software Entwicklung
Schlagworte	algorithm • Algorithm analysis and problem complexity • Algorithmic Mathematics • Algorithmics • algorithms • Algorithms Analysis • Algorithms Design • algorithms engineering • Algorithms Implementation • approximation algorithms • Case study • Combinatorial Mathematics • combinatorial optimization • computational geomet • Computational Geometry • Computational Graph Theory • computational mathematics • data structures • Design • Dynamic Programming • Efficient Algorithms • experimental algorithms • Graph Algorithms • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Heuristics • Linear Programming • Nash Equilibria • Optimization • Planar Graphs • quadratic programming • Scheduling • Searching • shortest paths • sorting • structured analysis
ISBN-10	3-540-68548-0 / 3540685480
ISBN-13	978-3-540-68548-7 / 9783540685487
Zustand	Neuware