Return to home page
Searching: Muskingum library catalog
Some OPAL libraries remain closed or are operating at reduced service levels. Materials from those libraries may not be requestable; requested items may take longer to arrive. Note that pickup procedures may differ between libraries. Please contact your library for new procedures, specific requests, or other assistance.
  Previous Record Previous Item Next Item Next Record
  Reviews, Summaries, etc...
EBOOK
Conference SEA (Symposium) (9th : 2010 : Ischia, Italy)
Title Experimental algorithms : 9th international symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010 : proceedings / Paola Festa (ed.).
Imprint Berlin ; New York : Springer, 2010.

LOCATION CALL # STATUS MESSAGE
 OHIOLINK SPRINGER EBOOKS    ONLINE  
View online
Conference SEA (Symposium) (9th : 2010 : Ischia, Italy)
Series Lecture notes in computer science, 0302-9743 ; 6049
LNCS sublibrary: SL 2-programming and software engineering
Lecture notes in computer science ; 6049.
LNCS sublibrary. SL 2, Programming and software engineering.
Subject Computer algorithms -- Congresses.
Algorithms.
Alt Name Festa, Paola.
LOCATION CALL # STATUS MESSAGE
 OHIOLINK SPRINGER EBOOKS    ONLINE  
View online
Conference SEA (Symposium) (9th : 2010 : Ischia, Italy)
Series Lecture notes in computer science, 0302-9743 ; 6049
LNCS sublibrary: SL 2-programming and software engineering
Lecture notes in computer science ; 6049.
LNCS sublibrary. SL 2, Programming and software engineering.
Subject Computer algorithms -- Congresses.
Algorithms.
Alt Name Festa, Paola.
Description 1 online resource (xii, 514 pages) : illustrations.
polychrome rdacc
Bibliography Note Includes bibliographical references and index.
Summary Annotation This volume constitutes the refereed proceedings of the 9th International Symposium on Experimental Algorithms, SEA 2010, held on Ischia Island, Naples, Italy, in May 2010. The 40 revised full papers presented together with two invited papers were carefully reviewed and selected from 73 submissions. The topics covered include algorithm engineering, algorithmic libraries, algorithmic mechanism design, analysis of algorithms, algorithms for memory hierarchies, approximation techniques, bioinformatics, branch and bound algorithms, combinatorial and irregular problems, combinatorial structures and graphs, communication networks, complex networks, computational geometry, computational learning theory, computational optimization, computer systems, cryptography and security, data streams, data structures, distributed and parallel algorithms, evaluation of algorithms for realistic environments, experimental techniques and statistics, graph drawing, heuristics for combinatorial optimization.
Contents Invited papers. Experimental study of resilient algorithms and data structures / Umberto Ferraro-Petrillo, Irene Finocchi, and Giuseppe F. Italiano -- Computational challenges with cliques, quasi-cliques and clique partitions in graphs / Panos M. Pardalos and Steffen Rebennack -- Contributed regular papers. Alternative routes in road networks / Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck -- Fully dynamic speed-up techniques for multi-criteria shortest path searches in time-dependent networks / Annabell Berger, Martin Grimmer, and Matthias Muller-Hannemann -- Space-efficient SHARC-routing / Edith Brunel, Daniel Delling, Andreas Gemsa, and Dorothea Wagner -- A new fully dynamic algorithm for distributed shortest paths and its experimental evaluation / Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, and Vinicio Maurizio -- Contraction of timetable networks with realistic transfers / Robert Geisberger -- Distributed time-dependent contraction hierarchies / Tim Kieritz, Dennis Luxen, Peter Sanders, and Christian Vetter -- Practical compressed suffix trees / Rodrigo Canovas and Gonzalo Navarro -- Maximum cliques in protein structure comparison / Noel Malod-Dognin, Rumen Andonov, and Nicola Yanev -- Exact bipartite crossing minimization under tree constraints / Frank Baumann, Christoph Buchheim, and Frauke Liers -- Bit-parallel search algorithms for long patterns / Branislav Durian, Hannu Peltola, Leena Salmela, and Jorma Tarhio -- Fast FPT algorithms for computing rooted agreement forests : theory and experiments (extended abstract) / Chris Whidden, Robert G. Beiko, and Norbert Zeh -- Experimental evaluation of approximation and heuristic algorithms for sorting railway cars / Alain Hauser and Jens Maue -- Time-dependent contraction hierarchies and approximation / Gernot Veit Batz, Robert Geisberger, Sabine Neubauer, and Peter Sanders -- A new combinational logic minimization technique with applications to cryptology / Joan Boyar and Rene Peralta -- Randomized rounding for routing and covering problems : experiments and improvements / Benjamin Doerr, Marvin Kunnemann, and Magnus Wahlstrom -- The time dependent traveling salesman problem : polyhedra and branch-cut-and-price algorithm / Hernan Abeledo, Ricardo Fukasawa, Artur Pessoa, and Eduardo Uchoa -- An approximate e-constraint method for the multi-objective undirected capacitated arc routing problem / Lucio Grandinetti, Francesca Guerriero, Demetrio Lagana, and Ornella Pisacane -- A branch-and-price algorithm for multi-mode resource leveling / Eamonn T. Coughlan, Marco E. Lubbecke, and Jens Schulz -- Experiments with a generic Dantzig-Wolfe decomposition for integer programs / Gerald Gamrath and Marco E. Lubbecke -- Using bound sets in multiobjective optimization : application to the biobjective binary knapsack problem / Charles Delort and Olivier Spanjaard -- Improving cutting plane generation with 0-1 inequalities by bi-criteria separation / Edoardo Amaldi, Stefano Coniglio, and Stefano Gualandi -- New lower bounds for the vehicle routing problem with simultaneous pickup and delivery / Anand Subramanian, Eduardo Uchoa, and Luiz Satoru Ochi -- A metaheuristic for a two echelon location-routing problem / Maurizio Boccia, Teodor G. Crainic, Antonio Sforza, and Claudio Sterle -- New fast heuristics for the 2D strip packing problem with guillotine constraint / Minh Hoang Ha, Francois Clautiaux, Said Hanafi, and Christophe Wilbaut -- An experimental comparison of different heuristics for the master bay plan problem / Daniela Ambrosino, Davide Anghinolfi, Massimo Paolucci, and Anna Sciomachen -- An analysis of heuristics for vertex colouring / Marco Chiarandini and Thomas Stutzle -- Automatic tuning of GRASP with path-relinking heuristics with a biased random-key genetic algorithm / Paola Festa, Jose F. Goncalves, Mauricio G.C. Resende, and Ricardo M.A. Silva -- Experiments with a feasibility pump approach for nonconvex MINLPs / Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, and Andrea Lodi -- Paging multiple users in cellular network : yellow page and conference call problems / Amotz Bar-Noy, Panagiotis Cheilaris, and Yi Feng -- Realtime classification for encrypted traffic / Roni Bar-Yanai, Michael Langberg, David Peleg, and Liam Roditty -- Data propagation with guaranteed delivery for mobile networks / Hakob Aslanyan, Pierre Leone, and Jose Rolim -- Data structures resilient to memory faults : an experimental study of dictionaries / Umberto Ferraro-Petrillo, Fabrizio Grandoni, and Giuseppe F. Italiano -- Experiments on union-find algorithms for the disjoint-set data structure / Md. Mostofa Ali Patwary, Jean Blair, and Fredrik Manne -- Policy-based benchmarking of weak heaps and their relatives / Asger Bruun, Stefan Edelkamp, Jyrki Katajainen, and Jens Rasmussen -- Modularity-driven clustering of dynamic graphs / Robert Gorke, Pascal Maillard, Christian Staudt, and Dorothea Wagner -- Gateway decompositions for constrained reachability problems / Bastian Katz, Marcus Krug, Andreas Lochbihler, Ignaz Rutter, Gregor Snelting, and Dorothea Wagner -- Robust and efficient Delaunay triangulations of points on or close to a sphere / el Caroli, Pedro M.M. de Castro, Sebastien Loriot, Olivier Rouiller, Monique Teillaud, and Camille Wormser -- Fault recovery in wireless networks : the geometric recolouring approach / Henk Meijer, Yurai Nunez-Rodriguez, and David Rappaport -- Geometric minimum spanning trees with GeoFilterKruskal / Samidh Chatterjee, Michael Connor, and Piyush Kumar -- Practical nearest neighbor search in the plane / Michael Connor and Piyush Kumar.
Note Print version record.
ISBN 9783642131936
364213193X
9783642131929 (pbk.)
3642131921 (pbk.)
OCLC # 663093902
Additional Format Print version: SEA 2010 (2010 : Ischia, Italy). Experimental algorithms. Berlin ; New York : Springer, 2010 9783642131929 3642131921 (DLC) 2010926863 (OCoLC)618334607


If you experience difficulty accessing or navigating this content, please contact the OPAL Support Team