Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Experimental Algorithms

14th International Symposium, SEA 2015, Paris, France, June 29 - July 1, 2015, Proceedings
BuchKartoniert, Paperback
404 Seiten
Englisch
Springererschienen am09.06.20152015
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.mehr
Verfügbare Formate
BuchKartoniert, Paperback
EUR53,49
E-BookPDF1 - PDF WatermarkE-Book
EUR53,49

Produkt

KlappentextThis 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.
Details
ISBN/GTIN978-3-319-20085-9
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2015
Erscheinungsdatum09.06.2015
Auflage2015
ReiheTheoretical Computer Science and General Issues
Seiten404 Seiten
SpracheEnglisch
Gewicht628 g
IllustrationenXI, 404 p. 80 illus.
Artikel-Nr.15594605

Inhalt/Kritik

Inhaltsverzeichnis
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 forthe Steiner Cycle Problem.- On the Quadratic Shortest Path Problem.- A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions.mehr

Schlagworte