Sciweavers

129 search results - page 23 / 26
» Algorithms for facility location problems with outliers
Sort
View
SODA
2010
ACM
178views Algorithms» more  SODA 2010»
14 years 4 months ago
Tree Embeddings for Two-Edge-Connected Network Design
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
PAMI
2006
156views more  PAMI 2006»
13 years 7 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann
FOCS
2000
IEEE
13 years 11 months ago
Fairness Measures for Resource Allocation
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
Amit Kumar, Jon M. Kleinberg
INFOCOM
2008
IEEE
14 years 1 months ago
Adding Capacity Points to a Wireless Mesh Network Using Local Search
Abstract— Wireless mesh network deployments are popular as a cost-effective means to provide broadband connectivity to large user populations. As the network usage grows, network...
Joshua Robinson, Mustafa Uysal, Ram Swaminathan, E...
FOCS
2004
IEEE
13 years 11 months ago
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
David B. Shmoys, Chaitanya Swamy