Sciweavers

415 search results - page 8 / 83
» An efficient approximation for the Generalized Assignment Pr...
Sort
View
CATS
2006
13 years 9 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
ICIP
2009
IEEE
13 years 6 months ago
Task-oriented camera assignment in a video network
Camera assignment and hand-off are some of the key image processing problems in a video network. In this paper, we propose a new approach for camera assignment and handoff in a vi...
Yiming Li, Bir Bhanu
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
FOCS
2006
IEEE
14 years 2 months ago
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
Uriel Feige, Jan Vondrák
DCOSS
2008
Springer
13 years 10 months ago
Frugal Sensor Assignment
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro...