The Resource Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings, edited by Evripidis Bampis, (electronic resource)

Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings, edited by Evripidis Bampis, (electronic resource)

Label
Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings
Title
Experimental Algorithms
Title remainder
14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings
Statement of responsibility
edited by Evripidis Bampis
Contributor
Editor
Provider
Subject
Language
eng
Summary
This book constitutes the refereed proceedings of the 14th International Symposium on Experimental Algorithms, SEA 2015, held in Paris, France, in June/July 2015. The 30 revised full papers presented were carefully reviewed and selected from 76 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. The papers are grouped in topical sections on data structures, graph problems, combinatorial optimization, scheduling and allocation, and transportation networks
Member of
Image bit depth
0
LC call number
QA76.9.A43
Literary form
non fiction
http://library.link/vocab/relatedWorkOrContributorName
  • Bampis, Evripidis.
  • SpringerLink
Series statement
Lecture Notes in Computer Science,
Series volume
9125
http://library.link/vocab/subjectName
  • Computer science
  • Data structures (Computer science)
  • Computer software
  • Electronic data processing
  • Computational complexity
  • Artificial intelligence
  • Algorithms
  • Computer Science
  • Algorithm Analysis and Problem Complexity
  • Discrete Mathematics in Computer Science
  • Data Structures
  • Numeric Computing
  • Algorithms
  • Artificial Intelligence (incl. Robotics)
Label
Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings, edited by Evripidis Bampis, (electronic resource)
Instantiates
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Data Structures -- Parallel Construction of Succinct Trees -- Tree Compression with Top Trees Revisited -- A Bulk-Parallel Priority Queue in External Memory with STXXL -- Graph Problems I -- Greedily Improving Our Own Centrality in a Network -- An Exact Algorithm for Diameters of Large Real Directed Graphs -- Graph Partitioning for Independent Sets -- Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments -- Combinatorial Optimization I -- On the Generation of Cutting Planes which Maximize the Bound Improvement -- Separation of Generic Cutting Planes in Branch-and-Price Using a Basis -- On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space -- Scheduling and Allocation -- Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors -- Station Assignment with Reallocation -- Online Knapsack of Unknown Capacity: Energy Optimization for Smartphone Communications -- Combinatorial Optimization II -- Reoptimization Techniques for MIP Solvers -- Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers -- Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver -- Efficient and Practical Tree Preconditioning for Solving Laplacian Systems -- Other Applications I -- Efficient Generation of Stable Planar Cages for Chemistry -- Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment -- Solving k-means on High-Dimensional Big Data -- X Contents -- Transportation Networks -- Public Transit Labeling -- On Balanced Separators in Road Networks -- SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks -- Other Applications II -- Huffman Codes versus Augmented Non-Prefix-Free Codes -- Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps -- in Bimatrix Games -- The Effect of Almost-Empty Faces on Planar Kandinsky Drawings -- Graph Problems II -- An Experimental Analysis of a Polynomial Compression for the Steiner Cycle Problem -- On the Quadratic Shortest Path Problem -- A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions
Dimensions
unknown
Extent
XI, 404 p. 80 illus.
File format
multiple file formats
Form of item
electronic
Isbn
9783319200866
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/978-3-319-20086-6
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-319-20086-6
Label
Experimental Algorithms : 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings, edited by Evripidis Bampis, (electronic resource)
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Data Structures -- Parallel Construction of Succinct Trees -- Tree Compression with Top Trees Revisited -- A Bulk-Parallel Priority Queue in External Memory with STXXL -- Graph Problems I -- Greedily Improving Our Own Centrality in a Network -- An Exact Algorithm for Diameters of Large Real Directed Graphs -- Graph Partitioning for Independent Sets -- Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments -- Combinatorial Optimization I -- On the Generation of Cutting Planes which Maximize the Bound Improvement -- Separation of Generic Cutting Planes in Branch-and-Price Using a Basis -- On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space -- Scheduling and Allocation -- Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors -- Station Assignment with Reallocation -- Online Knapsack of Unknown Capacity: Energy Optimization for Smartphone Communications -- Combinatorial Optimization II -- Reoptimization Techniques for MIP Solvers -- Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers -- Is Nearly-linear the Same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver -- Efficient and Practical Tree Preconditioning for Solving Laplacian Systems -- Other Applications I -- Efficient Generation of Stable Planar Cages for Chemistry -- Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment -- Solving k-means on High-Dimensional Big Data -- X Contents -- Transportation Networks -- Public Transit Labeling -- On Balanced Separators in Road Networks -- SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks -- Other Applications II -- Huffman Codes versus Augmented Non-Prefix-Free Codes -- Experimental Analysis of an Online Dictionary Matching Algorithm for Regular Expressions with Gaps -- in Bimatrix Games -- The Effect of Almost-Empty Faces on Planar Kandinsky Drawings -- Graph Problems II -- An Experimental Analysis of a Polynomial Compression for the Steiner Cycle Problem -- On the Quadratic Shortest Path Problem -- A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions
Dimensions
unknown
Extent
XI, 404 p. 80 illus.
File format
multiple file formats
Form of item
electronic
Isbn
9783319200866
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/978-3-319-20086-6
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-319-20086-6

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...