the proceedings contain 15 papers. the topics discussed include: a closer look at the closest string and closest substring problem;exact pattern matching with feed-forward bloom filters;fast and lightweight LCP-array ...
the proceedings contain 15 papers. the topics discussed include: a closer look at the closest string and closest substring problem;exact pattern matching with feed-forward bloom filters;fast and lightweight LCP-array construction algorithms;an elimination method for solving bivariate polynomial systems: eliminating the usual drawbacks;a simple parallel Cartesian tree algorithm and its application to suffix tree construction;avoiding communication in numerical linear algebra;disjoint-path facility location: theory and practice;approximate map matching with respect to the fréchet distance;algorithms for matching and predicting trajectories;dependent randomized rounding: the bipartite case;1D vehicle scheduling with conflicts;an SDP approach to multi-level crossing minimization;and simple and efficient distribution- sensitive point location in triangulations.
the proceedings contain 15 papers. the topics discussed include: an experimental study of minimum mean cycle algorithms;solving maximum flow problems on real world bipartite graphs;tuning BNDM with Q-grams;the filter-...
ISBN:
(纸本)9780898719307
the proceedings contain 15 papers. the topics discussed include: an experimental study of minimum mean cycle algorithms;solving maximum flow problems on real world bipartite graphs;tuning BNDM with Q-grams;the filter-kruskal minimum spanning tree algorithm;algorithmic problems in air traffic management;four-dimensional Hilbert curves for R-trees;the domination heuristic for lP-type problems;design and implementation of a practical I/O-efficient shortest paths algorithm;time-dependent contraction hierarchies;drawing binary tanglegrams: an experimental evaluation;dealing with large hidden constants: engineering a planar Steiner tree PTAS;theory and practice of monotone minimal perfect hashing;quasirandom rumor spreading: an experimental analysis;and experimental comparison of the two fredman-khachiyan-algorithms.
the proceedings contain 15 papers. the special focus in this conference is on algorithmengineering and experiments. the topics include: On the implementation of MST-based heuristics for the Steiner problem in graphs;...
ISBN:
(纸本)9783540439776
the proceedings contain 15 papers. the special focus in this conference is on algorithmengineering and experiments. the topics include: On the implementation of MST-based heuristics for the Steiner problem in graphs;a time-sensitive system for black-box combinatorial optimization;a compressed breadth-first search for satisfiability;using multi-level graphs for timetable information in railway systems;evaluating the local ratio algorithm for dynamic storage allocation;an experimental study of prefetching and caching algorithms for the world wide web;partitioning planar graphs with costs and weights;maintaining dynamic minimum spanning trees;experimental evaluation of a new shortest pathalgorithm;acceleration of k-means and related clustering algorithms;an efficient self-adjusting index for moving objects and an improvement on tree selection sort.
the proceedings contain 15 papers. the special focus in this conference is on algorithmengineering and experiments. the topics include: On the implementation of mst-based heuristics for the steiner problem in graphs;...
ISBN:
(纸本)3540439773
the proceedings contain 15 papers. the special focus in this conference is on algorithmengineering and experiments. the topics include: On the implementation of mst-based heuristics for the steiner problem in graphs;a time-sensitive system for black-box combinatorial optimization;a compressed breadth-first search for satisfiability;using multi-level graphs for timetable information in railway systems;evaluating the local ratio algorithm for dynamic storage allocation;an experimental study of prefetching and caching algorithms for the world wide web;the treewidth of java programs;partitioning planar graphs with costs and weights;maintaining dynamic minimum spanning trees;experimental evaluation of a new shortest pathalgorithm;getting more from out-of- core columnsort;topological sweep in degenerate cases;acceleration of K-Means and related clustering algorithms;an efficient self-adjusting index for moving objects and an improvement on tree selection sort.
the proceedings contain 15 papers. the topics discussed include: efficient algorithms for dualizing large-scale hypergraphs;a min-edge cost flow framework for capacitated covering problems;short and simple cycle separ...
ISBN:
(纸本)9781611972535
the proceedings contain 15 papers. the topics discussed include: efficient algorithms for dualizing large-scale hypergraphs;a min-edge cost flow framework for capacitated covering problems;short and simple cycle separators in planar graphs;polynomial-time construction of contraction hierarchies for multi-criteria objectives;3D kinetic alpha complexes and their implementation;computational topology and normal surfaces: theoretical and experimental complexity bounds;inducing suffix and LCP arrays in external memory;lempel-ZIV factorization: simple, fast, practical;fast packed string matching for short patterns;on parallelizing matrix multiplication by the column-row method;robust gossip-based aggregation: a practical point of view;and the cost of address translation.
Recent results on Java 7's dual pivot Quicksort have revealed its highly asymmetric nature. these insights suggest that asymmetric pivot choices are preferable to symmetric ones for this Quicksort variant. From a ...
详细信息
In this work, we introduce the Cov-MECF framework, a special case of minimum-edge cost flow in which the input graph is bipartite. We observe that several important covering (and multi-covering) problems are captured ...
详细信息
the proceedings contain 15 papers. the topics discussed include: experiments on density-constrained graph clustering;distributed evolutionary graph partitioning;exact combinatorial branch-and-bound for graph bisection...
ISBN:
(纸本)9781611972122
the proceedings contain 15 papers. the topics discussed include: experiments on density-constrained graph clustering;distributed evolutionary graph partitioning;exact combinatorial branch-and-bound for graph bisection;leveling the grid;evaluation of an MSO-solver;the complexity of partial orders;fast compressed tries through path decompositions;solving the minimum string cover problem;computing a consensus of multi-labeled trees;clique cover on sparse networks;an experimental and analytical study of order constraints for single machine scheduling with quadratic cost;user-constrained multi-modal route planning;round-based public transit routing;transit nodes - lower bounds and refined construction;robust mobile route planning with limited connectivity;and hierarchical heavy hitters withthe space saving algorithm.
the proceedings contain 15 papers. the topics discussed include: triangle listing algorithms: back from the diversion;on the scalability of computing triplet and quartet distances;simplifying massive planar subdivisio...
ISBN:
(纸本)9781611973198
the proceedings contain 15 papers. the topics discussed include: triangle listing algorithms: back from the diversion;on the scalability of computing triplet and quartet distances;simplifying massive planar subdivisions;distributed computation of persistent homology;top-k substring matching for auto-completion;multi-pivot quicksort: theory and experiments;a back-to-basics empirical study of priority queues;an exact approach to upward crossing minimization;practical experience with hanani-tutte for testing c-planarity;order constraints for single machine scheduling with non-linear cost;enumerating fundamental normal surfaces: algorithms, experiments and invariants;connection scan accelerated;precomputation techniques for the stochastic on-time arrival problem;and fast shortest-path distance queries on road networks by pruned highway labeling.
the proceedings contain 15 papers. the topics discussed include: cache replacement with memory allocation;a data-aware FM-index;improved single-term top-k document retrieval;(semi-)external algorithms for graph partit...
the proceedings contain 15 papers. the topics discussed include: cache replacement with memory allocation;a data-aware FM-index;improved single-term top-k document retrieval;(semi-)external algorithms for graph partitioning and clustering;the 12-3-toolkit for building your own balls-into-bins algorithm;computing MaxMin edge length triangulations;branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover;faster linear-space orthogonal range searching in arbitrary dimensions;region-based approximation algorithms for visibility between imprecise locations;engineering motif search for large graphs;experimental evaluation of multi-round matrix multiplication on MapReduce;approximating betweenness centrality in large evolving networks;and 2-connectivity in directed graphs: an experimental study.
暂无评论