Vor Ort
Merkzettel Warenkorb
  • Produktbild: Experimental Algorithms
  • Produktbild: Experimental Algorithms
Band 9125

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

Aus der Reihe Theoretical Computer Science and General Issues

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

09.06.2015

Abbildungen

XI, 80 illus., schwarz-weiss Illustrationen

Herausgeber

Evripidis Bampis

Verlag

Springer

Seitenzahl

404

Maße (L/B/H)

23,5/15,5/2,3 cm

Gewicht

628 g

Auflage

2015

Sprache

Englisch

ISBN

978-3-319-20085-9

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

09.06.2015

Abbildungen

XI, 80 illus., schwarz-weiss Illustrationen

Herausgeber

Evripidis Bampis

Verlag

Springer

Seitenzahl

404

Maße (L/B/H)

23,5/15,5/2,3 cm

Gewicht

628 g

Auflage

2015

Sprache

Englisch

ISBN

978-3-319-20085-9

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Experimental Algorithms
  • Produktbild: Experimental Algorithms

  • 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.