The proceedings contain 49 papers. The special focus in this conference is on algorithms and datastructures. The topics include: Preface;efficient text searching of regular expressions;optimal channel placement for m...
ISBN:
(纸本)9783540515425
The proceedings contain 49 papers. The special focus in this conference is on algorithms and datastructures. The topics include: Preface;efficient text searching of regular expressions;optimal channel placement for multi-terminal nets;computing the minimum visible vertex distance between two polygons;computing the kernel of a point set in a polygon;using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs;linear time algorithms for computing reachability regions from polygonal figures;computing the center of area of a polygon;weighted orthogonal linear L -approximation and applications;discs and other related datastructures;digital datastructures and order statistics;on the performance of orthogonal range queries in multiattribute and doubly chained trees;efficient spatial point location;probabilistic analysis of algorithms and datastructures;stabbing parallel segments with a convex polygon;selecting the Kth largest-area convex polygon;finding all shortest path edge sequences on a convex polyhedron;linear algorithms for parity path and two path problems on circular-arc graph;nC algorithms for circular-arc graphs;parallel algorithms for the subgraph homeomorphism problem;galleries, light matchings and visibility graphs;weighted visibility graphs of bars and related flow problems;parallel algorithms for cographs recognition and applications;constructing the Voronoi diagram of a set of line segments in parallel;dynamic datastructures for series parallel digraphs;motion planning in the CL-environment;self-adjusting k-ary search trees;improving partial rebuilding by using simple balance criteria;an efficient all-parses systolic algorithm for general context-free parsing;skip lists: A probabilistic alternative to balanced trees;structured NC.
algorithms and datastructures : 6Th International workshop, wads'99, Vancouver, Canada, August 11-14, 1999 : Proceedings by wads'99 (1999 : Vancouver, Canada); Dehne, F. (Frank), 1960-; published by Berlin ; ...
详细信息
algorithms and datastructures : 6Th International workshop, wads'99, Vancouver, Canada, August 11-14, 1999 : Proceedings by wads'99 (1999 : Vancouver, Canada); Dehne, F. (Frank), 1960-; published by Berlin ; New York : Springer
The proceedings contain 38 papers from the algorithms and datastructures: 9th International workshop, wads 2005. The topics discussed include: towards a theory of algorithms;heap building bounds;parameterized complex...
详细信息
The proceedings contain 38 papers from the algorithms and datastructures: 9th International workshop, wads 2005. The topics discussed include: towards a theory of algorithms;heap building bounds;parameterized complexity of generalized vertex cover problems;the complexity of implicit and space efficient priority queues;analysis of a class of tries with adaptive multi-digit branching;balanced aspect ratio trees revisited;improved combinatorial group testing for real-world problem sizes;approximating the online set multicover problems via randomized winnowing;succinct representation of triangulations with a boundary;line-segment intersection made in-place;improved fixed-parameter algorithms for two feedback set problems;and dynamic hotlinks.
The proceedings contain 42 papers. The special focus in this conference is on algorithms and datastructures, Invited Lecture The topics include: Discrepancy Theory and Computational Geometry;Dynamic Motion Planning i...
ISBN:
(纸本)3540633073
The proceedings contain 42 papers. The special focus in this conference is on algorithms and datastructures, Invited Lecture The topics include: Discrepancy Theory and Computational Geometry;Dynamic Motion Planning in Low Obstacle Density Environments;Visibility-Based Pursuit-Evasion in a Polygonal Environment;Maintaining the Extent of a Moving Point Set;Finding Cores of Limited Length;On Bipartite Crossings, Largest Biptanar Subgraphs, and the Linear Arrangement Problem;Approximation algorithms for a Genetic Diagnostics Problem;Cartographic Line Simplification and Polygon CSG Formulae in O(n Log'n) Time;Constrained TSP and Low-Power Computing;On-Line Load Balancing for Related Machines;A Linear-Time Algorithm for the 1-Mismatch Problem;On Some Geometric Optimization Problems in Layered Manufacturing;New TSP Construction Heuristics and Their Relationships To The 2-Opt;Pattern Matching in Hypertext;Multiple Approximate String Matching;Applied Computational Geometry;Checking the Convexity of Polytopes and the Planarity of Subdivisions;Voronoi Diagrams for Polygon-Offset Distance Functions;Randomized algorithms for that Ancient Scheduling Problem;Optimal Parallel algorithms for Proximate Points, with Applications;An Efficient Algorithm for Shortest Paths in Vertical and Horizontal Segments;On Geometric Path Query Problems;On-Line Scheduling with Hard Deadlines;Load Balanced Mapping of datastructures in Parallel Memory Modules for Fast and Conflict-Free Templates Access;Parallel vs. Parametric Complexity;Position-Independent Near Optimal Searching and On-Line Recognition in Star Polygons;Dynamic datastructures for Fat Objects and Their Applications and Intractability of Assembly Sequencing: Unit Disks in the Plane.
The proceedings contain 56 papers. The topics discussed include: orthogonal range searching in linear and almost-linear space;spherical LSH for approximate nearest neighbor search on unit hypersphere;approximating the...
详细信息
ISBN:
(纸本)3540739483
The proceedings contain 56 papers. The topics discussed include: orthogonal range searching in linear and almost-linear space;spherical LSH for approximate nearest neighbor search on unit hypersphere;approximating the maximum sharing problem;edges and switches, tunnels and bridges;drawing colored graphs on colored points;priority queues resilient to memory faults;simple and space-efficient minimal perfect hash functions;approximate algorithms for the sex-equal stable marriage problem;flooding countries and destroying dams;on a family of strong geometric spanners that admit local routing strategies;spanners for geometric intersection graphs;on generalized diamond spanners;improved results for a memory allocation problem;kernelization and complexity results for connectivity augmentation problems;and optimal lightweight construction of suffix arrays for constant alphabets.
The proceedings contain 43 papers. The special focus in this conference is on algorithms and datastructures. The topics include: Approximation of multiobjective optimization problems;optimal, suboptimal, and robust a...
ISBN:
(纸本)3540424237
The proceedings contain 43 papers. The special focus in this conference is on algorithms and datastructures. The topics include: Approximation of multiobjective optimization problems;optimal, suboptimal, and robust algorithms for proximity graphs;optimal mobius transformations for information visualization and meshing;using the pseudo-dimension to analyze approximation algorithms for integer programming;on the complexity of scheduling conditional real-time code;time responsive external datastructures for moving points;voronoi diagrams for moving disks and applications;fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover;deciding clique-width for graphs of bounded tree-width;complexity bounds for vertical decompositions of linear arrangements in four dimensions;optimization over zonotopes and training support vector machines;reporting intersecting pairs of polytopes in two and three dimensions;seller-focused algorithms for online auctioning;competitive analysis of the LRFU paging algorithm;admission control to minimize rejections;secure multi-party computational geometry;the grid placement problem;on the reflexivity of point sets;approximating multi-objective knapsack problems;visual ranking of link structures;a simple linear time algorithm for proper box rectangular drawings of plane graphs;short and simple labels for small distances and other functions;fast boolean matrix multiplication for highly clustered data;partitioning colored point sets into monochromatic parts;the analysis of a probabilistic approach to nearest neighbor searching;I/O-efficient shortest path queries in geometric spanners;higher-dimensional packing with order constraints;bin packing with item fragmentation and practical approximation algorithms for separable packing linear programs.
暂无评论