796 search results - page 112 / 160 » Approximating the centroid is hard |
SIAMDM
2008
13 years 7 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
TCS
2008
13 years 7 months ago
2008
We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in ...
JACM
2007
13 years 7 months ago
2007
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
TOG
2008
13 years 7 months ago
2008
We present a new discretization for the physics-based animation of developable surfaces. Constrained to not deform at all in-plane but free to bend out-of-plane, these are an exce...
TON
2008
13 years 7 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...