Sciweavers

4894 search results - page 31 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
COCOON
2007
Springer
14 years 3 months ago
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
Andrzej Czygrinow, Michal Hanckowiak
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 11 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
FSTTCS
2009
Springer
14 years 3 months ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
14 years 17 days 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
SIAMNUM
2010
106views more  SIAMNUM 2010»
13 years 3 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...