| 000 | 06998nam a22005415i 4500 | ||
|---|---|---|---|
| 001 | u374426 | ||
| 003 | SIRSI | ||
| 005 | 20160812084234.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100427s2010 gw | s |||| 0|eng d | ||
| 020 |
_a9783642131936 _9978-3-642-13193-6 |
||
| 040 | _cMX-MeUAM | ||
| 050 | 4 | _aQA76.9.A43 | |
| 082 | 0 | 4 |
_a005.1 _223 |
| 100 | 1 |
_aFesta, Paola. _eeditor. |
|
| 245 | 1 | 0 |
_aExperimental Algorithms _h[recurso electrónico] : _b9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings / _cedited by Paola Festa. |
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010. |
|
| 300 |
_aXII, 514p. 126 illus. _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, _x0302-9743 ; _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 and Delivery -- 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. | |
| 520 | _aThis proceedings volume contains the invited papers and the contributed papers th accepted for presentation at the 9 International Symposium on Experimental Algorithms (SEA 2010), that was held at the Continental Terme Hotel, Ischia (Naples), Italy, during May 20–22, 2010. PrevioussymposiaoftheserieswereheldinRiga(2001),MonteVerita(2003), RiodeJaneiro(2004),Santorini(2005),Menorca(2006),Rome(2007),CapeCod (2008), and Dortmund (2009). Seventy-three papers were submitted by researchers from 19 countries. Each paper was reviewed by three experts among the Program Committee members and some trusted external referees. At least two reviewers were from the same or closely related discipline as the authors. The reviewers generally provided a high-quality assessment of the papers and often gave extensive comments to the authors for the possible improvement of the presentation. The submission and review process was supported by the ConfTool conference management software and we are thankful to Harald Weinreich for letting us use it. The Program Committee selected 40 regular papers for presentation at the conference. In addition to the 40 contributed papers, this volume includes two invitedpapersrelatedtocorrespondingkeynotetalks:GiuseppeF.Italiano(U- versity of Rome “Tor Vergata,”Italy)spoke on “ExperimentalStudy of Resilient Algorithms and Data Structures” and PanosM. Pardalos(University of Florida, USA) spoke on “Computational Challenges with Cliques, Quasi-Cliques and Clique Partitions in Graphs.” Many people and organizations contributed to SEA 2010. We are parti- larlygrateful for the patronageand ?nancial support of the University of Naples “FedericoII”andtheDepartmentofMathematicsandApplications“R.Cacci- poli,”and for the ?nancial support of GNCS (Gruppo Nazionale per il Calcolo Scienti?co) – INdAM (Istituto Nazionale di Alta Matematica). | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputer Communication Networks. | |
| 650 | 0 | _aComputer software. | |
| 650 | 0 | _aDatabase management. | |
| 650 | 0 | _aInformation storage and retrieval systems. | |
| 650 | 0 | _aInformation systems. | |
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
| 650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
| 650 | 2 | 4 | _aInformation Systems Applications (incl.Internet). |
| 650 | 2 | 4 | _aComputer Communication Networks. |
| 650 | 2 | 4 | _aInformation Storage and Retrieval. |
| 650 | 2 | 4 | _aDatabase Management. |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642131929 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6049 |
|
| 856 | 4 | 0 |
_zLibro electrónico _uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-13193-6 |
| 596 | _a19 | ||
| 942 | _cLIBRO_ELEC | ||
| 999 |
_c202306 _d202306 |
||