Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Cited in

(only showing first 100 items - show all)

Optimal movement of mobile sensors for barrier coverage of a planar region
Parallel and sequential computation: A statistician's view
A fast algorithm for the alpha-connected two-center decision problem
Acrophobic guard watchtower problem
Generalized edge-rankings of trees (extended abstract)
Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
Diameter, width, closest line pair, and parametric searching
Optimal slope selection via cuttings
An efficient algorithm for the three-dimensional diameter problem
Optimization with additional variables and constraints
Sigma-local graphs
Geometric pattern matching under Euclidean motion
Algorithms and complexity analysis for some flow problems
The geodesic 2-center problem in a simple polygon
EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS
Iterated nearest neighbors and finding minimal polytopes
Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem
On some geometric selection and optimization problems via sorted matrices
Continuous location of dimensional structures.
Placing two disks in a convex polygon
Three problems about simple polygons
Locating an obnoxious line among planar objects
The \(k\)-centrum multi-facility location problem
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
scientific article; zbMATH DE number 835509 (Why is no real title available?)
Prune-and-search with limited workspace
Parametric problems on graphs of bounded tree-width
An efficient algorithm for the proximity connected two center problem
On finding widest empty curved corridors
Guarding a terrain by two watchtowers
Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\)
Efficient algorithms for center problems in cactus networks
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
Intersecting disks using two congruent disks
Intersecting disks using two congruent disks
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
Minimizing Distance-to-Sight in Polygonal Domains
Covering a point set by two disjoint rectangles
A near-linear algorithm for the planar segment-center problem
Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
Constructive Interference in Parallel Algorithms
One-way and round-trip center location problems
Minmax regret k-sink location on a dynamic path network with uniform capacities
Efficient algorithms for the sum selection problem and \(k\) maximum sums problem
Weight reduction problems with certain bottleneck objectives.
Interval finding and its application to data mining
On reverse shortest paths in geometric proximity graphs
An adaptive and cost-optimal parallel algorithm for minimum spanning trees
Optimal edge ranking of trees in polynomial time
Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
Fréchet distance with speed limits
Partitioning point sets in arbitrary dimension
Improved algorithms for some competitive location centroid problems on paths, trees and graphs
Compact location problems
Construction of \(\epsilon\)-nets
Minimizing the maximum moving cost of interval coverages
Faster algorithms for largest empty rectangles and boxes
Computing the Fréchet distance between piecewise smooth curves
On minimum and maximum spanning trees of linearly moving points
Algorithmic results for ordered median problems
Almost optimal algorithms for diameter-optimally augmenting trees
On approximating partial scenario set cover
The \((1 | 1)\)-centroid problem in the plane with distance constraints
scientific article; zbMATH DE number 3907755 (Why is no real title available?)
Computing and minimizing the relative regret in combinatorial optimization with interval data
The two-center problem of uncertain points on a real line
One-dimensional \(k\)-center on uncertain data
Optimal Embedding into Star Metrics
Optimal parametric search on graphs of bounded tree-width
Exact algorithms for the bottleneck Steiner tree problem
Synergy in parallel algorithms
New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
On the planar piecewise quadratic 1-center problem
An inverse model for the most uniform problem
Fast algorithms for collision and proximity problems involving moving geometric objects
Space-sweep algorithms for parametric optimization
Improving a solution's quality through parallel processing
Parametric search made practical
Orthogonal queries in segments
A generalized model of equality measures in network location problems
On the decisional complexity of problems over the reals
Optimal slope selection via expanders
Simplex Range Searching and Its Variants: A Review
Obnoxious facility location: complete service with minimal harm
An incremental and parametrical algorithm for convex-concave fractional programming with a single constraint
A general approximation method for bicriteria minimization problems
Simple algorithms for partial point set pattern matching under rigid motion
On some geometric selection and optimization problems via sorted matrices
Queries on Voronoi diagrams on moving points
Computing the geodesic center of a simple polygon
Finding a minimum-weight k-link path in graphs with the concave Monge property and applications
Combinatorially implosive algorithms
A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\).
Revisiting k-sum optimization
On the planar two-center problem and circular hulls
Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover
Traffic Networks and Flows over Time
OR Forum—Perspectives on Parallel Computing
Efficient piecewise-linear function approximation using the uniform metric

This page was built for publication: Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763585)