Experimental and efficient algorithms : second international workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003 : proceedings / Klaus Jansen [and others](eds.).
Contributor(s): Jansen, KlausMaterial type: TextSeries: SerienbezeichnungLecture notes in computer science: 2647.Publisher: Berlin ; New York : Springer, ©2003Description: 1 online resource (viii, 266 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540448679; 3540448675Subject(s): Computer algorithms -- Congresses | Computer algorithmsGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:WEA 2003 (2003 : Ascona, Switzerland): Experimental and efficient algorithms : second international workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003 : proceedings.DDC classification: 005.1 LOC classification: QA76.9.A43 | W43 2003Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Includes bibliographical references and index.
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.
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.