Experimental and Efficient Algorithms
Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings
1st Edition
Published on 15. May 2003
Book
Paperback/Softback
VIII, 272 pages
978-3-540-40205-3 (ISBN)
Description
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.
More details
Series
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
VIII, 272 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 16 mm
Weight
435 gr
ISBN-13
978-3-540-40205-3 (9783540402053)
DOI
10.1007/3-540-44867-5
Schweitzer Classification
Other editions
Additional editions
Klaus Jansen | Marian Margraf | Monaldo Mastrolilli
Experimental and Efficient Algorithms
Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings
E-Book
12/2007
Springer
€53.49
Available for download
Persons
Content
Improving Linear Programming Approaches for the Steiner Tree Problem.- Algorithms and Experiments on Colouring Squares of Planar Graphs.- Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem.- Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm.- An On-Line Algorithm for the Rectangle Packing Problem with Rejection.- New Lower and Upper Bounds for Graph Treewidth.- Search Data Structures for Skewed Strings.- Evaluation of Basic Protocols for Optical Smart Dust Networks.- Linear Time Local Improvements for Weighted Matchings in Graphs.- Experimental Studies of Graph Traversal Algorithms.- A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning.- Comparing Push- and Pull-Based Broadcasting.- Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility Location.- A Lazy Version of Eppstein's K Shortest Paths Algorithm.- Linear Algorithm for 3-Coloring of Locally Connected Graphs.- A Clustering Algorithm for Interval Graph Test on Noisy Data.- Core Instances for Testing: A Case Study.- The Reliable Algorithmic Software Challenge RASC.- A New Class of Greedy Heuristics for Job Shop Scheduling Problems.- Algorithmic Techniques for Memory Energy Reduction.- A Framework for Designing Approximation Algorithms for Scheduling Problems.- Analysis and Visualization of Social Networks.