Ebook: Experimental Algorithms: 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings
- Tags: Algorithm Analysis and Problem Complexity, Artificial Intelligence (incl. Robotics), Information Systems Applications (incl.Internet), Computer Communication Networks, Programming Techniques, Algorithms
- Series: Lecture Notes in Computer Science 6630
- Year: 2011
- Publisher: Springer-Verlag Berlin Heidelberg
- Edition: 1
- Language: English
- pdf
This volume constitutes the refereed proceedings of the 10th International Symposium on Experimental Algorithms, SEA 2011, held in Kolimpari, Chania, Crete, Greece, in May 2011. The 36 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 83 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.
This volume constitutes the refereed proceedings of the 10th International Symposium on Experimental Algorithms, SEA 2011, held in Kolimpari, Chania, Crete, Greece, in May 2011. The 36 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 83 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.
This volume constitutes the refereed proceedings of the 10th International Symposium on Experimental Algorithms, SEA 2011, held in Kolimpari, Chania, Crete, Greece, in May 2011. The 36 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 83 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.
Content:
Front Matter....Pages -
Approximability of Symmetric Bimatrix Games and Related Experiments....Pages 1-20
Metaheuristic Optimization: Algorithm Analysis and Open Problems....Pages 21-32
Convexity and Optimization of Condense Discrete Functions....Pages 33-42
Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results....Pages 43-53
Hierarchical Delaunay Triangulation for Meshing....Pages 54-64
A Parallel Multi-start Search Algorithm for Dynamic Traveling Salesman Problem....Pages 65-75
Online Dictionary Matching with Variable-Length Gaps....Pages 76-87
Dynamic Arc-Flags in Road Networks....Pages 88-99
Efficient Routing in Road Networks with Turn Costs....Pages 100-111
On Minimum Changeover Cost Arborescences....Pages 112-123
Localizing Program Logical Errors Using Extraction of Knowledge from Invariants....Pages 124-135
Compressed String Dictionaries....Pages 136-147
Combinatorial Optimization for Weighing Matrices with the Ordering Messy Genetic Algorithm....Pages 148-156
Improved Automated Reaction Mapping....Pages 157-168
An Experimental Evaluation of Incremental and Hierarchical k-Median Algorithms....Pages 169-180
Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem....Pages 181-192
Practical Compressed Document Retrieval....Pages 193-205
Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems....Pages 206-217
An Experimental Evaluation of Treewidth at Most Four Reductions....Pages 218-229
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks....Pages 230-241
Hierarchy Decomposition for Faster User Equilibria on Road Networks....Pages 242-253
Matching in Bipartite Graph Streams in a Small Number of Passes....Pages 254-266
Beyond Unit Propagation in SAT Solving....Pages 267-279
Designing Difficult Office Space Allocation Problem Instances with Mathematical Programming....Pages 280-291
Speed Dating....Pages 292-303
Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs....Pages 304-314
A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem....Pages 315-326
A Biased Random Key Genetic Algorithm Approach for Unit Commitment Problem....Pages 327-339
A Column Generation Approach to Scheduling of Periodic Tasks....Pages 340-351
Fuzzy Clustering the Backward Dynamic Slices of Programs to Identify the Origins of Failure....Pages 352-363
Listing All Maximal Cliques in Large Sparse Real-World Graphs....Pages 364-375
Customizable Route Planning....Pages 376-387
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks....Pages 388-399
Explanations for the Cumulative Constraint: An Experimental Study....Pages 400-409
GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data....Pages 410-420
An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem....Pages 421-433
Generating Time Dependencies in Road Networks....Pages 434-446
An Empirical Evaluation of Extendible Arrays....Pages 447-458
Back Matter....Pages -
This volume constitutes the refereed proceedings of the 10th International Symposium on Experimental Algorithms, SEA 2011, held in Kolimpari, Chania, Crete, Greece, in May 2011. The 36 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 83 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.
Content:
Front Matter....Pages -
Approximability of Symmetric Bimatrix Games and Related Experiments....Pages 1-20
Metaheuristic Optimization: Algorithm Analysis and Open Problems....Pages 21-32
Convexity and Optimization of Condense Discrete Functions....Pages 33-42
Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results....Pages 43-53
Hierarchical Delaunay Triangulation for Meshing....Pages 54-64
A Parallel Multi-start Search Algorithm for Dynamic Traveling Salesman Problem....Pages 65-75
Online Dictionary Matching with Variable-Length Gaps....Pages 76-87
Dynamic Arc-Flags in Road Networks....Pages 88-99
Efficient Routing in Road Networks with Turn Costs....Pages 100-111
On Minimum Changeover Cost Arborescences....Pages 112-123
Localizing Program Logical Errors Using Extraction of Knowledge from Invariants....Pages 124-135
Compressed String Dictionaries....Pages 136-147
Combinatorial Optimization for Weighing Matrices with the Ordering Messy Genetic Algorithm....Pages 148-156
Improved Automated Reaction Mapping....Pages 157-168
An Experimental Evaluation of Incremental and Hierarchical k-Median Algorithms....Pages 169-180
Engineering the Modulo Network Simplex Heuristic for the Periodic Timetabling Problem....Pages 181-192
Practical Compressed Document Retrieval....Pages 193-205
Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems....Pages 206-217
An Experimental Evaluation of Treewidth at Most Four Reductions....Pages 218-229
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks....Pages 230-241
Hierarchy Decomposition for Faster User Equilibria on Road Networks....Pages 242-253
Matching in Bipartite Graph Streams in a Small Number of Passes....Pages 254-266
Beyond Unit Propagation in SAT Solving....Pages 267-279
Designing Difficult Office Space Allocation Problem Instances with Mathematical Programming....Pages 280-291
Speed Dating....Pages 292-303
Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs....Pages 304-314
A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem....Pages 315-326
A Biased Random Key Genetic Algorithm Approach for Unit Commitment Problem....Pages 327-339
A Column Generation Approach to Scheduling of Periodic Tasks....Pages 340-351
Fuzzy Clustering the Backward Dynamic Slices of Programs to Identify the Origins of Failure....Pages 352-363
Listing All Maximal Cliques in Large Sparse Real-World Graphs....Pages 364-375
Customizable Route Planning....Pages 376-387
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks....Pages 388-399
Explanations for the Cumulative Constraint: An Experimental Study....Pages 400-409
GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data....Pages 410-420
An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem....Pages 421-433
Generating Time Dependencies in Road Networks....Pages 434-446
An Empirical Evaluation of Extendible Arrays....Pages 447-458
Back Matter....Pages -
....
Download the book Experimental Algorithms: 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings for free or read online
Continue reading on any device:
Last viewed books
Related books
{related-news}
Comments (0)