product iamge

Experimental and Efficient Algorithms: Second International Workshop, WEA 2003, Ascona, Switzerland, May 26–28, 2003 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Ernst Althaus, Tobias Polzin (auth.), Klaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim (eds.)
Series: Lecture Notes in Computer Science 2647
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2003

Language: English
Pages: 272
Tags: Algorithm Analysis and Problem Complexity; Data Structures; Numeric Computing; Discrete Mathematics in Computer Science; Computer Graphics

Improving Linear Programming Approaches for the Steiner Tree Problem....Pages 1-14
Algorithms and Experiments on Colouring Squares of Planar Graphs....Pages 15-32
Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem....Pages 33-46
Fast-Search : A New Efficient Variant of the Boyer-Moore String Matching Algorithm....Pages 47-58
An On-Line Algorithm for the Rectangle Packing Problem with Rejection....Pages 59-69
New Lower and Upper Bounds for Graph Treewidth....Pages 70-80
Search Data Structures for Skewed Strings....Pages 81-96
Evaluation of Basic Protocols for Optical Smart Dust Networks....Pages 97-106
Linear Time Local Improvements for Weighted Matchings in Graphs....Pages 107-119
Experimental Studies of Graph Traversal Algorithms....Pages 120-133
A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning....Pages 134-147
Comparing Push- and Pull-Based Broadcasting....Pages 148-164
Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility Location....Pages 165-178
A Lazy Version of Eppstein’s K Shortest Paths Algorithm....Pages 179-191
Linear Algorithm for 3-Coloring of Locally Connected Graphs....Pages 191-194
A Clustering Algorithm for Interval Graph Test on Noisy Data....Pages 195-208
Core Instances for Testing: A Case Study....Pages 209-222
The Reliable Algorithmic Software Challenge RASC....Pages 222-222
A New Class of Greedy Heuristics for Job Shop Scheduling Problems....Pages 223-236
Algorithmic Techniques for Memory Energy Reduction....Pages 237-252
A Framework for Designing Approximation Algorithms for Scheduling Problems....Pages 253-260
Analysis and Visualization of Social Networks....Pages 261-266