Applying Parallel Computation Algorithms in the Design of Serial Algorithms
From MaRDI portal
Publication:3763585
Cited in
(only showing first 100 items - show all)- Tow algorithms for finding a minimal ratio hamiltonian cycle in a network
- The quickest flow problem
- The constrained minimum spanning tree problem
- Computing the smallest k-enclosing circle and related problems
- Improved algorithms for the bichromatic two-center problem for pairs of points
- Geometric \(p\)-center problems with centers constrained to two lines
- Fitting rectilinear polgonal curves to a set of points in the plane.
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
- Parametric search: three new applications
- Locating two obnoxious facilities using the weighted maximin criterion
- A generalized approximation framework for fractional network flow and packing problems
- Constructing the minimization diagram of a two-parameter problem
- The inverse-parametric knapsack problem
- A submodular optimization problem with side constraints
- Reverse shortest path problem for unit-disk graphs
- New Upper Bounds on Continuous Tree Edge-Partition Problem
- scientific article; zbMATH DE number 4064461 (Why is no real title available?)
- Efficient planar two-center algorithms
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- Submodular function minimization
- Linear approximation of simple objects
- SMOOTHING IMPRECISE 1.5D TERRAINS
- Decomposable multi-parameter matroid optimization problems.
- Layouts for improved hierarchical parallel computations
- On ray shooting in convex polytopes
- Packing two disks in a polygon
- A combinatorial algorithm for the ordered 1-median problem on cactus graphs
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches
- Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip
- A linear-time algorithm for solving continuous maximin knapsack problems
- Geometric pattern matching in d-dimensional space
- Dynamic ham-sandwich cuts in the plane
- A new contraction technique with applications to congruency-constrained cuts
- Assigning weights to minimize the covering radius in the plane
- Building bridges between convex regions
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Farthest-polygon Voronoi diagrams
- Off-line dynamic maintenance of the width of a planar point set
- Selecting distances in arrangements of hyperplanes spanned by points.
- Finding effective ``Force targets for two-dimensional, multifinger frictional grips
- Extremal polygon containment problems
- PRO: a model for the design and analysis of efficient and scalable parallel algorithms
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
- Selection in monotone matrices and computing k th nearest neighbors
- Slowing down sorting networks to obtain faster sorting algorithms
- Computing the Fréchet distance between simple polygons
- Bisecting three classes of lines
- Can we compute the similarity between surfaces?
- Strongly polynomial-time approximation for a class of bicriteria problems.
- Optimal spanners for axis-aligned rectangles
- The multi-weighted spanning tree problem
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- scientific article; zbMATH DE number 2090609 (Why is no real title available?)
- Budget-constrained minimum cost flows
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
- Computing the smallest \(k\)-enclosing circle and related problems
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Approximating points by a piecewise linear function
- Fractional 0-1 programming: applications and algorithms
- LABELING POINTS WITH RECTANGLES OF VARIOUS SHAPES
- Efficient algorithms for the minimum diameter bridge problem
- A note on searching line arrangements and applications
- Efficient randomized algorithms for some geometric optimization problems
- An approximation algorithm for least median of squares regression
- On enclosing k points by a circle
- Single facility collection depots location problem in the plane
- Constrained square-center problems
- Center location problems on tree graphs with subtree-shaped customers
- Modifying edges of a network to obtain short subgraphs
- The economic lot-sizing problem with an emission capacity constraint
- Continuous bottleneck tree partitioning problems
- Fast algorithms for diameter-optimally augmenting paths and trees
- Distance-constrained multifacility minimax location problems on tree networks
- Repetitive hidden-surface-removal for polyhedral scenes
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks
- Approximate parametric searching
- Almost optimal algorithms for diameter-optimally augmenting trees
- Parallel selection
- Bottleneck capacity expansion problems with general budget constraints
- Consecutive interval query and dynamic programming on intervals
- The cyclical scheduling problem
- Packing two disks into a polygonal environment.
- On the complexity and approximability of budget-constrained minimum cost flows
- Selecting distances in the plane
- Optimal algorithms for geometric centers and depth
- A strongly polynomial algorithm for line search in submodular polyhedra
- The maximin line problem with regional demand
- A sweepline algorithm to solve the two-center problem
- CYLINDRICAL HIERARCHY FOR DEFORMING NECKLACES
- Scheduling autonomous vehicle platoons through an unregulated intersection
- Output-sensitive results on convex hulls, extreme points, and related problems
- Generalized max flows and augmenting paths
- Randomized optimal algorithm for slope selection
- Integrality in the multinetwork min‐cost equal‐flow problem
- A linear time randomizing algorithm for searching ranked functions
- A deterministic algorithm for the three-dimensional diameter problem
- Point location in zones of \(k\)-flats in arrangements
- L-infinity interdistance selection by parametric search
- Linear-time fitting of a \(k\)-step function
- Linear-time fitting of a \(k\)-step function
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)
