Experimental Algorithms 15th International Symposium SEA 2016 St Petersburg Russia June 5 8 2016 Proceedings 1st Edition by Andrew Goldberg, Alexander Kulikov ISBN 3319388517 9783319388519

Experimental Algorithms 15th International Symposium SEA 2016 St Petersburg Russia June 5 8 2016 Proceedings 1st Edition by Andrew V. Goldberg, Alexander S. Kulikov – Ebook PDF Instant Download/Delivery: 3319388517, 978-3319388519
Full dowload Experimental Algorithms 15th International Symposium SEA 2016 St Petersburg Russia June 5 8 2016 Proceedings 1st Edition after payment

Product details:

ISBN 10:      3319388517
ISBN 13: 978-3319388519
Author:      Andrew V. Goldberg, Alexander S. Kulikov

Experimental Algorithms 15th International Symposium SEA 2016 St Petersburg Russia June 5 8 2016 Proceedings 1st Table of contents:

1. Practical Variable Length Gap Pattern Matching Using Wavelet Trees

• Investigates efficient methods for pattern matching with variable-length gaps using wavelet tree data structures.

2. Fast Exact Computation of Isochrones in Road Networks

• Focuses on algorithms for computing isochrones (areas of equal travel time) in road networks, enabling fast and accurate time-based analysis.

3. Dynamic Time-Dependent Route Planning in Road Networks with User Preferences

• Proposes dynamic route planning in road networks, taking into account time-dependent data and user-specific preferences (e.g., shortest path, least traffic).

4. UKP5: A New Algorithm for the Unbounded Knapsack Problem

• Introduces an algorithm for solving the unbounded knapsack problem, improving on existing methods in terms of efficiency or scalability.

5. Lempel-Ziv Decoding in External Memory

• Discusses an external memory-efficient approach to decoding using the Lempel-Ziv algorithm, which is widely used in data compression.

6. A Practical Method for the Minimum Genus of a Graph: Models and Experiments

• Provides a practical solution for determining the minimum genus of a graph, which is the lowest number of “holes” required for an embedding in a surface.

7. Compact Flow Diagrams for State Sequences

• Proposes compact representations for flow diagrams, improving the visualization and understanding of state transitions in systems.

8. Practical Dynamic Entropy-Compressed Bitvectors with Applications

• Discusses entropy-compressed bitvectors and their dynamic operations, focusing on practical applications in areas like data storage and retrieval.

9. Accelerating Local Search for the Maximum Independent Set Problem

• Improves the efficiency of local search algorithms used to find the maximum independent set in graph theory.

10. Computing Nonsimple Polygons of Minimum Perimeter

• A method for computing nonsimple polygons (non-self-intersecting) that minimize perimeter, with applications in computational geometry.

11. Sparse Subgraphs for 2-Connectivity in Directed Graphs

• Explores algorithms for finding sparse subgraphs that maintain 2-connectivity in directed graphs, a key property in network design.

12. Worst-Case-Efficient Dynamic Arrays in Practice

• Examines the practical implementation of dynamic arrays that achieve worst-case efficiency, with a focus on performance in real-world applications.

13. On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-Core Processors

• Discusses the use of algorithm portfolios to solve problems related to circulant weighing matrices, leveraging multi-core processors for performance.

14. Engineering Hybrid DenseZDDs

• Introduces Hybrid Dense Zero-Suppressed Decision Diagrams (DenseZDDs) and discusses their engineering for improved efficiency in combinatorial problems.

15. Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances

• Proposes a heuristic for solving the Steiner Tree problem in Euclidean space, optimizing distances using bottleneck metrics.

16. Tractable Pathfinding for the Stochastic On-Time Arrival Problem

• Focuses on pathfinding techniques that handle uncertainty in travel times, addressing the stochastic on-time arrival problem in navigation and logistics.

17. An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem

• Conducts an experimental evaluation of approximation algorithms designed for solving the Maximum Satisfiability (MaxSAT) problem.

18. Experimental Analysis of Algorithms for Coflow Scheduling

• Analyzes different algorithms for coflow scheduling, a key problem in data centers and parallel computing.

19. An Empirical Study of Online Packet Scheduling Algorithms

• Provides an empirical study of online algorithms for packet scheduling, aiming to improve network performance in real-time.

20. Advanced Multilevel Node Separator Algorithms

• Discusses advanced algorithms for dividing large graphs into smaller, more manageable components through node separators.

21. A Merging Heuristic for the Rectangle Decomposition of Binary Matrices

• Introduces a heuristic for decomposing binary matrices into smaller rectangles, optimizing for certain criteria such as space or computation time.

22. CHICO: A Compressed Hybrid Index for Repetitive Collections

• Presents CHICO, a compressed hybrid index that efficiently handles repetitive collections, improving data search and retrieval times.

23. Fast Scalable Construction of (Minimal Perfect Hash) Functions

• Explores methods for constructing minimal perfect hash functions efficiently, focusing on scalability and performance in large datasets.

24. Better Partitions of Protein Graphs for Subsystem Quantum Chemistry

• Investigates improved graph partitioning techniques for protein graphs, with applications in quantum chemistry simulations of protein structures.

25. Online Algorithm for Approximate Quantile Queries on Sliding Windows

• Proposes an online algorithm to approximate quantile queries over sliding windows, useful for real-time data stream analysis.

 

People also search for Experimental Algorithms 15th International Symposium SEA 2016 St Petersburg Russia June 5 8 2016 Proceedings 1st :

symposium on experimental algorithms 2024
journal of experimental algorithms
experimental evaluation of learning algorithms
algorithm experimental analysis
an experimental design perspective on model-based reinforcement learning

Tags:

Andrew Goldberg,Alexander Kulikov,Experimental,Algorithms,International,Symposium,Petersburg,Russia,Proceedings 1st