| 000 | 05320nam a22006015i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-13193-6 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125628.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100427s2010 gw | s |||| 0|eng d | ||
| 020 |
_a9783642131936 _9978-3-642-13193-6 |
||
| 024 | 7 |
_a10.1007/978-3-642-13193-6 _2doi |
|
| 050 | 4 | _aQA76.6-76.66 | |
| 072 | 7 |
_aUM _2bicssc |
|
| 072 | 7 |
_aCOM051000 _2bisacsh |
|
| 072 | 7 |
_aUM _2thema |
|
| 082 | 0 | 4 |
_a005.11 _223 |
| 245 | 1 | 0 |
_aExperimental Algorithms _h[electronic resource] : _b9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings / _cedited by Paola Festa. |
| 250 | _a1st ed. 2010. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010. |
|
| 300 |
_aXII, 514 p. 126 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6049 |
|
| 505 | 0 | _aInvited Papers -- Experimental Study of Resilient Algorithms and Data Structures -- Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs -- Contributed Regular Papers -- Alternative Routes in Road Networks -- Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks -- Space-Efficient SHARC-Routing -- A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation -- Contraction of Timetable Networks with Realistic Transfers -- Distributed Time-Dependent Contraction Hierarchies -- Practical Compressed Suffix Trees -- Maximum Cliques in Protein Structure Comparison -- Exact Bipartite Crossing Minimization under Tree Constraints -- Bit-Parallel Search Algorithms for Long Patterns -- Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments -- Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars -- Time-Dependent Contraction Hierarchies and Approximation -- A New Combinational Logic Minimization Technique with Applications to Cryptology -- Randomized Rounding for Routing and Covering Problems: Experiments and Improvements -- The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm -- An Approximate ?-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem -- A Branch-and-Price Algorithm for Multi-mode Resource Leveling -- Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs -- Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem -- Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation -- New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup andDelivery -- A Metaheuristic for a Two Echelon Location-Routing Problem -- New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint -- An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem -- An Analysis of Heuristics for Vertex Colouring -- Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm -- Experiments with a Feasibility Pump Approach for Nonconvex MINLPs -- Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems -- Realtime Classification for Encrypted Traffic -- Data Propagation with Guaranteed Delivery for Mobile Networks -- Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries -- Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure -- Policy-Based Benchmarking of Weak Heaps and Their Relatives, -- Modularity-Driven Clustering of Dynamic Graphs -- Gateway Decompositions for Constrained Reachability Problems -- Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere -- Fault Recovery in Wireless Networks: The Geometric Recolouring Approach -- Geometric Minimum Spanning Trees with GeoFilterKruskal -- Practical Nearest Neighbor Search in the Plane. | |
| 650 | 0 | _aComputer programming. | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 0 | _aApplication software. | |
| 650 | 0 | _aComputer networks . | |
| 650 | 0 | _aInformation storage and retrieval systems. | |
| 650 | 1 | 4 | _aProgramming Techniques. |
| 650 | 2 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aArtificial Intelligence. |
| 650 | 2 | 4 | _aComputer and Information Systems Applications. |
| 650 | 2 | 4 | _aComputer Communication Networks. |
| 650 | 2 | 4 | _aInformation Storage and Retrieval. |
| 700 | 1 |
_aFesta, Paola. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642131929 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642131943 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6049 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-13193-6 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cSPRINGER | ||
| 999 |
_c180035 _d180035 |
||