Results 1  10
of
277,596
A firstorder primaldual algorithm for convex problems with applications to imaging
, 2010
"... In this paper we study a firstorder primaldual algorithm for convex optimization problems with known saddlepoint structure. We prove convergence to a saddlepoint with rate O(1/N) in finite dimensions, which is optimal for the complete class of nonsmooth problems we are considering in this paper ..."
Abstract

Cited by 435 (20 self)
 Add to MetaCart
In this paper we study a firstorder primaldual algorithm for convex optimization problems with known saddlepoint structure. We prove convergence to a saddlepoint with rate O(1/N) in finite dimensions, which is optimal for the complete class of nonsmooth problems we are considering
PrimalDual Algorithms for Connected Facility Location Problems
"... Abstract. We consider the Connected Facility Location problem. We are given a graph G = (V, E) with cost ce on edge e, a set of facilitiesF ` ..."
Abstract
 Add to MetaCart
Abstract. We consider the Connected Facility Location problem. We are given a graph G = (V, E) with cost ce on edge e, a set of facilitiesF `
Lecture 5: PrimalDual Algorithms and Facility Location
, 2008
"... In the last lecture, we saw an LP rounding algorithm for the metric uncapacitated facility location problem that achieves 4approximation. In this lecture, we will see how the concepts of linear programming duality and complementary slackness can be used to get better approximation algorithms for UF ..."
Abstract
 Add to MetaCart
In the last lecture, we saw an LP rounding algorithm for the metric uncapacitated facility location problem that achieves 4approximation. In this lecture, we will see how the concepts of linear programming duality and complementary slackness can be used to get better approximation algorithms
Return of the PrimalDual: Distributed Metric Facility Location
"... In this paper we present fast, distributed approximation algorithms for the metric facility location problem in the CON GEST model, where message sizes are bounded by O(log N) bits, N being the network size. We first show how to obtain a 7approximation in O(log m+log n) rounds via the primaldual m ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
techniques are based on the primaldual algorithm due to Jain and Vazirani (JACM 2001) and a rapid randomized sparsification of graphs due to Gfeller and Vicari (PODC 2007). These results complement the results of Moscibroda and Wattenhofer (PODC 2005) for nonmetric facility location and extend the results
Primaldual algorithms for connected facility location problems
 Algorithmica
, 2002
"... We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F ⊆ V, and a set of clients D ⊆ V. Facility i has a facility opening cost fi and client j has dj units of demand. We are also given a parameter M ≥ 1. A solution ope ..."
Abstract

Cited by 79 (9 self)
 Add to MetaCart
were not combinatorial — they were obtained by solving an exponential size linear programming relaxation. Our algorithm integrates the primaldual approaches for the facility location problem [11] and the Steiner tree problem [1, 3]. We also consider the connected kmedian problem and give a constant
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
The Cricket LocationSupport System
, 2000
"... This paper presents the design, implementation, and evaluation of Cricket, a locationsupport system for inbuilding, mobile, locationdependent applications. It allows applications running on mobile and static nodes to learn their physical location by using listeners that hear and analyze informatio ..."
Abstract

Cited by 1036 (11 self)
 Add to MetaCart
This paper presents the design, implementation, and evaluation of Cricket, a locationsupport system for inbuilding, mobile, locationdependent applications. It allows applications running on mobile and static nodes to learn their physical location by using listeners that hear and analyze
An Efficient Boosting Algorithm for Combining Preferences
, 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract

Cited by 707 (18 self)
 Add to MetaCart
The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new
Results 1  10
of
277,596