000 04379nam a22006735i 4500
001 978-3-540-44867-9
003 DE-He213
005 20240423132513.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 _a9783540448679
_9978-3-540-44867-9
024 7 _a10.1007/3-540-44867-5
_2doi
050 4 _aT57-57.97
072 7 _aPBW
_2bicssc
072 7 _aMAT003000
_2bisacsh
072 7 _aPBW
_2thema
082 0 4 _a519
_223
245 1 0 _aExperimental and Efficient Algorithms
_h[electronic resource] :
_bSecond International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings /
_cedited by Klaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim.
250 _a1st ed. 2003.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2003.
300 _aVIII, 272 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2647
505 0 _aImproving 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 _aMathematics.
650 0 _aAlgorithms.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aNumerical analysis.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aComputer graphics.
650 1 4 _aApplications of Mathematics.
650 2 4 _aAlgorithms.
650 2 4 _aData Science.
650 2 4 _aNumerical Analysis.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer Graphics.
700 1 _aJansen, Klaus.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMargraf, Marian.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMastrolilli, Monaldo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRolim, José D. P.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540402053
776 0 8 _iPrinted edition:
_z9783662177426
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2647
856 4 0 _uhttps://doi.org/10.1007/3-540-44867-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188482
_d188482