As part of a comparative ethnographic study of everyday life of young professionals in London, Los Angeles, and Tokyo, we conducted a detailed survey of wallets and their contents...
Scott D. Mainwaring, Ken Anderson, Michele F. Chan...
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
We describe a general approach to optimization which we term Squeaky Wheel" Optimization SWO. In SWO, a greedy algorithm is used to construct a solution which is then analyze...
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...