國立虎尾科技大學 |

Experimental Algorithms = 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Experimental Algorithms/ edited by Evripidis Bampis.
Reminder of title:	14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings /
other author:	Bampis, Evripidis.
Description:	XI, 404 p. 80 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-319-20086-6
ISBN:	9783319200866

Experimental Algorithms = 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings /
Experimental Algorithms14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings /[electronic resource] :edited by Evripidis Bampis. - 1st ed. 2015. - XI, 404 p. 80 illus.online resource. - Theoretical Computer Science and General Issues ;9125. - Theoretical Computer Science and General Issues ;9163.

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.

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.

ISBN: 9783319200866

Standard No.: 10.1007/978-3-319-20086-6doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Experimental Algorithms = 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings /
LDR:04231nam a22004095i 4500 001 961057
003 DE-He213
005 20200629140115.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319200866 $9 978-3-319-20086-6
024 7 $a 10.1007/978-3-319-20086-6 $2 doi
035 $a 978-3-319-20086-6
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Experimental Algorithms $h [electronic resource] : $b 14th International Symposium, SEA 2015, Paris, France, June 29 – July 1, 2015, Proceedings / $c edited by Evripidis Bampis.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a XI, 404 p. 80 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 9125
505 0 $a 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.
520 $a 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.
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Numerical analysis. $3 527939
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Numeric Computing. $3 669943
650 2 4 $a Artificial Intelligence. $3 646849
700 1 $a Bampis, Evripidis. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 896851
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319200873
776 0 8 $i Printed edition: $z 9783319200859
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-20086-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)