Experimental algorithms 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings /
This book constitutes the refereed proceedings of the 11th International Symposium on Experimental Algorithms, SEA 2012, held Bordeaux, France, in June 2012. The 31 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 64 submissions and present curre...
| Corporate Authors: | SEA (Symposium) Bordeaux, France) |
|---|---|
| Other Authors: | SEA (Symposium), Klasing, Ralf., SpringerLink (Online service) |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer,
©2012.
Berlin ; New York : [2012] |
| Physical Description: |
1 online resource. |
| Series: |
Lecture notes in computer science ;
7276. LNCS sublibrary. Programming and software engineering. |
| Subjects: |
| Summary: |
This book constitutes the refereed proceedings of the 11th International Symposium on Experimental Algorithms, SEA 2012, held Bordeaux, France, in June 2012. The 31 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 64 submissions and present current research in the area of design, analysis, and experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. |
|---|---|
| Item Description: |
Includes bibliographical references and author index. Automatic Decomposition and Branch-and-Price-A Status Report / Marco E. Lübbecke -- Continuous Local Strategies for Robotic Formation Problems / Barbara Kempkes and Friedhelm Meyer auf der Heide -- Engineering Graph Partitioning Algorithms / Vitaly Osipov, Peter Sanders and Christian Schulz -- Space Efficient Modifications to Structator- A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns / Benjamin Albrecht and Volker Heun -- Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs / Eric Angel, Romain Campigotto and Christian Laforest -- How to Attack the NP-Complete Dag Realization Problem in Practice / Annabell Berger and Matthias Müller-Hannemann -- New Results about Multi-band Uncertainty in Robust Optimization / Christina Büsing and Fabio D'Andreagiovanni -- Compact Relaxations for Polynomial Programming Problems / Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti and Frédéric Messine -- Relaxations of Multilinear Convex Envelopes: Dual Is Better Than Primal / Alberto Costa and Leo Liberti -- On Computing the Diameter of Real-World Directed (Weighted) Graphs / Pierluigi Crescenzi, Roberto Grossi, Leonardo Lanzi and Andrea Marino -- Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications / Annalisa D'Andrea and Guido Proietti. Engineering a New Loop-Free Shortest Paths Routing Algorithm / Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni and Vinicio Maurizio -- Fully Dynamic Maintenance of Arc-Flags in Road Networks / Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni and Camillo Vitale -- A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs / Martin Dietzfelbinger, Hendrik Peilke and Michael Rink -- Branch Mispredictions Don't Affect Mergesort / Amr Elmasry, Jyrki Katajainen and Max Stenmark -- A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms / Simone Faro and Thierry Lecroq -- Algorithms for Subnetwork Mining in Heterogeneous Networks / Guillaume Fertin, Hafedh Mohamed Babou and Irena Rusu -- Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs / Donatella Firmani, Giuseppe F. Italiano, Luigi Laura, Alessio Orlandi and Federico Santaroni -- Adaptive Distributed b-Matching in Overlays with Preferences / Giorgos Georgiadis and Marina Papatriantafilou -- Dynamizing Succinct Tree Representations / Stelios Joannou and Rajeev Raman -- A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network / Dominik Kirchler, Leo Liberti and Roberto Wolfler Calvo -- Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data / Masashi Kiyomi, Yoshio Okamoto and Toshiki Saitoh. Candidate Sets for Alternative Routes in Road Networks / Dennis Luxen and Dennis Schieferdecker -- Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation / David F. Manlove and Gregg O'Malley -- An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic / Farnaz Moradi, Tomas Olovsson and Philippas Tsigas -- Fast, Small, Simple Rank/Select on Bitmaps / Gonzalo Navarro and Eliana Providel -- Space-Efficient Top-k Document Retrieval / Gonzalo Navarro and Daniel Valenzuela -- Engineering Efficient Paging Algorithms / Gabriel Moruz, Andrei Negoescu, Christian Neumann and Volker Weichert -- Feasibility Pump Heuristics for Column Generation Approaches / Pierre Pesneau, Ruslan Sadykov and François Vanderbeck -- Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems / Michael N. Rice and Vassilis J. Tsotras -- Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach / Jörg Rothe and Lena Schend -- Advanced Coarsening Schemes for Graph Partitioning / Ilya Safro, Peter Sanders and Christian Schulz -- A Heuristic for Non-convex Variance-Based Clustering Criteria / Rodrigo F. Toso, Casimir A. Kulikowski and Ilya B. Muchnik -- A Decomposition Approach for Solving Critical Clique Detection Problems / Jose L. Walteros and Panos M. Pardalos. This book constitutes the refereed proceedings of the 11th International Symposium on Experimental Algorithms, SEA 2012, held Bordeaux, France, in June 2012. The 31 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 64 submissions and present current research in the area of design, analysis, and experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. English. |
| Physical Description: |
1 online resource. |
| Bibliography: |
Includes bibliographical references and author index. |
| ISBN: |
9783642308505 3642308503 |
| ISSN: |
0302-9743 ; |