Sciweavers

6315 search results - page 202 / 1263
» Approximating Solution Structure
Sort
View
CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
15 years 10 months ago
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
Ming-Yang Kao, Manan Sanghi
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
SIAMDM
2008
139views more  SIAMDM 2008»
15 years 6 months ago
Approximate Integer Decompositions for Undirected Network Design Problems
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
Chandra Chekuri, F. Bruce Shepherd
INFOCOM
2010
IEEE
15 years 4 months ago
Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
Dengpan Zhou, Jie Gao
SIAMNUM
2010
106views more  SIAMNUM 2010»
15 years 1 months ago
Approximation of the Buckling Problem for Reissner-Mindlin Plates
This paper deals with the approximation of the buckling coefficients and modes of a clamped plate modeled by the Reissner-Mindlin equations. These coefficients are related with the...
Carlo Lovadina, David Mora, Rodolfo Rodrígu...