6 citations · 13 across the 6 of their papers we have counts for
6 papers
Optimal Parametric Search for Path and Tree Partitioning
Greg N. Frederickson, Samson Zhou
We present linear-time algorithms for partitioning a path or a tree with weights on the vertices by removing edges to maximize the minimum-weight component. We also use the sam…
Speedup in the Traveling Repairman Problem with Constrained Time Windows
Greg N. Frederickson, Barry Wittman
A bicriteria approximation algorithm is presented for the unrooted traveling repairman problem, realizing increased profit in return for increased speedup of repairman motion. The…
Two Multivehicle Routing Problems with Unit-Time Windows
Greg N. Frederickson, Barry Wittman
Two multivehicle routing problems are considered in the framework that a visit to a location must take place during a specific time window in order to be counted and all time windo…
Speedup in the Traveling Repairman Problem with Unit Time Windows
Greg N. Frederickson, Barry Wittman
The input to the unrooted traveling repairman problem is an undirected metric graph and a subset of nodes, each of which has a time window of unit length. Given that a repairman ca…
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems
Greg N. Frederickson, Barry Wittman
Constant-factor, polynomial-time approximation algorithms are presented for two variations of the traveling salesman problem with time windows. In the first variation, the travelin…
Hinged Dissection of Polyominoes and Polyforms
Erik D. Demaine, Martin L. Demaine, David Eppstein +2
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection o…