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

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 su...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Jansen, Klaus (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Margraf, Marian (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Mastrolilli, Monaldo (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Rolim, José D. P. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
Έκδοση:1st ed. 2003.
Σειρά:Lecture Notes in Computer Science, 2647
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04734nam a2200637 4500
001 978-3-540-44867-9
003 DE-He213
005 20191024041938.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 |a 9783540448679  |9 978-3-540-44867-9 
024 7 |a 10.1007/3-540-44867-5  |2 doi 
040 |d GrThAP 
050 4 |a T57-57.97 
072 7 |a PBW  |2 bicssc 
072 7 |a MAT003000  |2 bisacsh 
072 7 |a PBW  |2 thema 
082 0 4 |a 519  |2 23 
245 1 0 |a Experimental and Efficient Algorithms  |h [electronic resource] :  |b Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings /  |c edited by Klaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim. 
250 |a 1st ed. 2003. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2003. 
300 |a VIII, 272 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2647 
505 0 |a 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. 
520 |a  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. 
650 0 |a Applied mathematics. 
650 0 |a Engineering mathematics. 
650 0 |a Algorithms. 
650 0 |a Data structures (Computer science). 
650 0 |a Numerical analysis. 
650 0 |a Computer science-Mathematics. 
650 0 |a Computer graphics. 
650 1 4 |a Applications of Mathematics.  |0 http://scigraph.springernature.com/things/product-market-codes/M13003 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Data Structures.  |0 http://scigraph.springernature.com/things/product-market-codes/I15017 
650 2 4 |a Numeric Computing.  |0 http://scigraph.springernature.com/things/product-market-codes/I1701X 
650 2 4 |a Discrete Mathematics in Computer Science.  |0 http://scigraph.springernature.com/things/product-market-codes/I17028 
650 2 4 |a Computer Graphics.  |0 http://scigraph.springernature.com/things/product-market-codes/I22013 
700 1 |a Jansen, Klaus.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Margraf, Marian.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Mastrolilli, Monaldo.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Rolim, José D. P.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662177426 
776 0 8 |i Printed edition:  |z 9783540402053 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2647 
856 4 0 |u https://doi.org/10.1007/3-540-44867-5  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)