Cantitate/Preț
Produs
Total produse
Vezi coșul
Experimental and Efficient Algorithms: Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings de Klaus Jansen

Experimental and Efficient Algorithms: Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings: Lecture Notes in Computer Science, cartea 2647

Editat de Klaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim
en Limba Engleză Paperback – 15 mai 2003
 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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 37959 lei

Nou

Puncte Express: 569
Preț estimativ în valută:
7267€ • 7554$ • 6025£

Carte tipărită la comandă

Livrare economică 06-20 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540402053
ISBN-10: 3540402055
Pagini: 284
Ilustrații: VIII, 272 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.4 kg
Ediția:2003
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.