scientific article; zbMATH DE number 6472586
From MaRDI portal
Publication:5501789
zbMath1321.68500MaRDI QIDQ5501789
Publication date: 14 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (35)
Improved algorithms for the bichromatic two-center problem for pairs of points ⋮ Efficiently approximating color-spanning balls ⋮ The mixed center location problem ⋮ Constrained square-center problems ⋮ New algorithms for \(k\)-center and extensions ⋮ The Discrete and Mixed Minimax 2-Center Problem ⋮ An efficient algorithm for the proximity connected two center problem ⋮ A local search approximation algorithm for \(k\)-means clustering ⋮ Streaming with minimum space: an algorithm for covering by two congruent balls ⋮ Discrete and mixed two-center problems for line segments ⋮ The Mixed Center Location Problem ⋮ Efficient algorithms for computing one or two discrete centers hitting a set of line segments ⋮ The discrete and mixed minimax 2-center problems ⋮ The two-center problem of uncertain points on a real line ⋮ Efficient \(k\)-center algorithms for planar points in convex position ⋮ The 2-center problem in three dimensions ⋮ Minimum-sum dipolar spanning tree in \(\mathbb R^3\) ⋮ Efficient planar two-center algorithms ⋮ The 1-Center and 1-Highway Problem ⋮ Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares ⋮ Optimal location of transportation devices ⋮ The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited ⋮ A simple linear algorithm for computing rectilinear 3-centers ⋮ Bichromatic 2-center of pairs of points ⋮ Parametric search: three new applications ⋮ Efficient approximation algorithms for clustering point-sets ⋮ Minimum perimeter-sum partitions in the plane ⋮ Covering convex polygons by two congruent disks ⋮ Intersecting disks using two congruent disks ⋮ A fast algorithm for the alpha-connected two-center decision problem ⋮ Intersecting disks using two congruent disks ⋮ Point set stratification and Delaunay depth ⋮ On interval and circular-arc covering problems ⋮ New Algorithms for k-Center and Extensions ⋮ On the planar two-center problem and circular hulls
This page was built for publication:
