Applying Parallel Computation Algorithms in the Design of Serial Algorithms
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Center location problems on tree graphs with subtree-shaped customers
- A fast algorithm for the alpha-connected two-center decision problem
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Single facility collection depots location problem in the plane
- Dynamic ham-sandwich cuts in the plane
- Computing all large sums-of-pairs in \(\mathbb R^n\) and the discrete planar two-watchtower problem
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- Optimal movement of mobile sensors for barrier coverage of a planar region
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees
- Solving NP-hard problems in 'almost trees': vertex cover
- An incremental and parametrical algorithm for convex-concave fractional programming with a single constraint
- Parallel and sequential computation: A statistician's view
- Partitioning point sets in arbitrary dimension
- A linear time randomizing algorithm for searching ranked functions
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
- L-infinity interdistance selection by parametric search
- Fast algorithms for collision and proximity problems involving moving geometric objects
- Randomized optimal algorithm for slope selection
- Finding effective ``Force targets for two-dimensional, multifinger frictional grips
- Off-line dynamic maintenance of the width of a planar point set
- On some geometric selection and optimization problems via sorted matrices
- Modifying edges of a network to obtain short subgraphs
- Algorithms and complexity analysis for some flow problems
- A sweepline algorithm to solve the two-center problem
- Iterated nearest neighbors and finding minimal polytopes
- Computing the smallest k-enclosing circle and related problems
- Computing maximum mean cuts
- Extremal polygon containment problems
- Finding a minimum-weight k-link path in graphs with the concave Monge property and applications
- On minimum and maximum spanning trees of linearly moving points
- Orthogonal queries in segments
- Optimal slope selection via cuttings
- The inverse-parametric knapsack problem
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Compact location problems
- Consecutive interval query and dynamic programming on intervals
- Decomposable multi-parameter matroid optimization problems.
- Continuous location of dimensional structures.
- Weight reduction problems with certain bottleneck objectives.
- Placing two disks in a convex polygon
- Packing two disks in a polygon
- The geodesic 2-center problem in a simple polygon
- Revisiting k-sum optimization
- Fractional 0-1 programming: applications and algorithms
- Optimization with additional variables and constraints
- A near-linear algorithm for the planar segment-center problem
- Efficient randomized algorithms for some geometric optimization problems
- Output-sensitive results on convex hulls, extreme points, and related problems
- Synergy in parallel algorithms
- Continuous bottleneck tree partitioning problems
- On the decisional complexity of problems over the reals
- Algorithmic results for ordered median problems
- Efficient algorithms for the minimum diameter bridge problem
- Building bridges between convex regions
- Optimal edge ranking of trees in polynomial time
- Efficient piecewise-linear function approximation using the uniform metric
- Point location in zones of \(k\)-flats in arrangements
- A deterministic algorithm for the three-dimensional diameter problem
- Queries on Voronoi diagrams on moving points
- Acrophobic guard watchtower problem
- On the planar two-center problem and circular hulls
- Almost optimal algorithms for diameter-optimally augmenting trees
- An efficient algorithm for the proximity connected two center problem
- Linear-time fitting of a \(k\)-step function
- Efficient planar two-center algorithms
- Bisecting three classes of lines
- Parametric search: three new applications
- Sigma-local graphs
- Efficient algorithms for the sum selection problem and \(k\) maximum sums problem
- A linear-time algorithm for solving continuous maximin knapsack problems
- An FPTAS for the knapsack problem with parametric weights
- Minmax regret k-sink location on a dynamic path network with uniform capacities
- A combinatorial algorithm for the ordered 1-median problem on cactus graphs
- Assigning weights to minimize the covering radius in the plane
- On the complexity and approximability of budget-constrained minimum cost flows
- Selecting distances in the plane
- Efficient algorithms for center problems in cactus networks
- Approximating points by a piecewise linear function
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs
- On the planar piecewise quadratic 1-center problem
- On finding widest empty curved corridors
- A general approximation method for bicriteria minimization problems
- A strongly polynomial algorithm for line search in submodular polyhedra
- Three problems about simple polygons
- A note on searching line arrangements and applications
- A generalized model of equality measures in network location problems
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Intersection of unit-balls and diameter of a point set in \(\mathbb R^3\).
- Simple algorithms for partial point set pattern matching under rigid motion
- One-way and round-trip center location problems
- Locating two obnoxious facilities using the weighted maximin criterion
- Constructing the minimization diagram of a two-parameter problem
- The two-center problem of uncertain points on a real line
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover
- Obnoxious facility location: complete service with minimal harm
- Bottleneck capacity expansion problems with general budget constraints
- Linear-time fitting of a k-step function
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- Budget-constrained minimum cost flows
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)
