10 citations · 18 across the 6 of their papers we have counts for
4 papers · 1 filter
Minimum-Length Coordinated Motions For Two Convex Centrally-Symmetric Robots
David Kirkpatrick, Paul Liu
We study the problem of determining coordinated motions, of minimum total length, for two arbitrary convex centrally-symmetric (CCS) robots in an otherwise obstacle-free plane. Usi…
Approximation Schemes for Covering and Packing in the Streaming Model
Christopher Liaw, Paul Liu, Robert Reiss
The shifting strategy, introduced by Hochbaum and Maass, and independently by Baker, is a unified framework for devising polynomial approximation schemes to NP-Hard problems. This…
Characterizing minimum-length coordinated motions for two discs
David Kirkpatrick, Paul Liu
We study the problem of determining optimal coordinated motions for two disc robots in an otherwise obstacle-free plane. Using the total path length traced by the two disc centres…
A fast 25/6-approximation for the minimum unit disk cover problem
Paul Liu, Daniel Lu
Given a point set P in 2D, the problem of finding the smallest set of unit disks that cover all of P is NP-hard. We present a simple algorithm for this problem with an approximatio…