Coverart for item
The Resource Experimental algorithms : 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings, Ralf Klasing (eds.), (electronic book)

Experimental algorithms : 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings, Ralf Klasing (eds.), (electronic book)

Label
Experimental algorithms : 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings
Title
Experimental algorithms
Title remainder
11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings
Statement of responsibility
Ralf Klasing (eds.)
Title variation
SEA 2012
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
GW5XE
Dewey number
005.1
Index
index present
LC call number
QA76.9.A43
LC item number
S43 2012
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2012
http://bibfra.me/vocab/lite/meetingName
SEA 2012
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorName
Klasing, Ralf
Series statement
  • Lecture notes in computer science,
  • LNCS sublibrary. SL 2, Programming and software engineering
Series volume
7276
http://library.link/vocab/subjectName
Computer algorithms
Label
Experimental algorithms : 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings, Ralf Klasing (eds.), (electronic book)
Instantiates
Publication
Note
International conference proceedings
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
Color
multicolored
Contents
  • 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
  • Automatic Decomposition and Branch-and-Price-A Status Report
  • 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
  • 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
  • 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
  • Engineering a New Loop-Free Shortest Paths Routing Algorithm
  • 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
  • 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
  • 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
  • Candidate Sets for Alternative Routes in Road Networks
  • 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
  • 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
Control code
SPR794843119
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642308499
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote
Label
Experimental algorithms : 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings, Ralf Klasing (eds.), (electronic book)
Publication
Note
International conference proceedings
Antecedent source
unknown
Bibliography note
Includes bibliographical references and author index
Color
multicolored
Contents
  • 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
  • Automatic Decomposition and Branch-and-Price-A Status Report
  • 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
  • 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
  • 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
  • Engineering a New Loop-Free Shortest Paths Routing Algorithm
  • 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
  • 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
  • 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
  • Candidate Sets for Alternative Routes in Road Networks
  • 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
  • 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
Control code
SPR794843119
Dimensions
unknown
Extent
1 online resource.
File format
unknown
Form of item
online
Isbn
9783642308499
Level of compression
unknown
Quality assurance targets
not applicable
Reformatting quality
unknown
Reproduction note
Electronic resource.
Sound
unknown sound
Specific material designation
remote

Library Locations

Processing Feedback ...