Results 1  10
of
1,415,377
A PrimalDual Schema Based Approximation Algorithm for the Element Connectivity Problem
, 1999
"... The element connectivity problem falls in the category of survivable network design problems  it is intermediate to the versions that ask for edgedisjoint and vertexdisjoint paths. The edge version is by now well understood from the viewpoint of approximation algorithms, but very little is know ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
The element connectivity problem falls in the category of survivable network design problems  it is intermediate to the versions that ask for edgedisjoint and vertexdisjoint paths. The edge version is by now well understood from the viewpoint of approximation algorithms, but very little
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
Approximate Labeling via the PrimalDual Schema
, 2005
"... A linear programming based framework is presented which is capable of providing combinatorialbased approximation algorithms to a certain class of NPcomplete classification problems. The resulting algorithms utilize tools from the duality theory of linear programming and have guaranteed optimality ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
A linear programming based framework is presented which is capable of providing combinatorialbased approximation algorithms to a certain class of NPcomplete classification problems. The resulting algorithms utilize tools from the duality theory of linear programming and have guaranteed optimality
Generic Schema Matching with Cupid
 In The VLDB Journal
, 2001
"... Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past s ..."
Abstract

Cited by 593 (17 self)
 Add to MetaCart
solutions, showing that a rich range of techniques is available. We then propose a new algorithm, Cupid, that discovers mappings between schema elements based on their names, data types, constraints, and schema structure, using a broader set of techniques than past approaches. Some of our innovations
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 `
PrimalDual Combinatorial Algorithms
"... Linear program and its duality have long been ubiquitous tools for analyzing NPhard problems and designing fast approximation algorithms. Plotkin et al proposed a primaldual combinatorial algorithm based on linear duality for fractional packing and covering, which achieves significant speedup on a ..."
Abstract
 Add to MetaCart
Linear program and its duality have long been ubiquitous tools for analyzing NPhard problems and designing fast approximation algorithms. Plotkin et al proposed a primaldual combinatorial algorithm based on linear duality for fractional packing and covering, which achieves significant speedup on a
PrimalDual Schema for Capacitated Covering Problems
, 2008
"... Primaldual algorithms have played an integral role in recent developments in approximation algorithms, and yet there has been little work on these algorithms in the context of LP relaxations that have been strengthened by the addition of more sophisticated valid inequalities. We introduce primal ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
schema based on the LP relaxations devised by Carr, Fleischer, Leung & Phillips for the minimum knapsack problem as well as for the singledemand capacitated facility location problem. Our primaldual algorithms achieve the same performance guarantees as the LProunding algorithms of Carr et al
Property Testing and its connection to Learning and Approximation
"... We study the question of determining whether an unknown function has a particular property or is fflfar from any function with that property. A property testing algorithm is given a sample of the value of the function on instances drawn according to some distribution, and possibly may query the fun ..."
Abstract

Cited by 498 (68 self)
 Add to MetaCart
the function on instances of its choice. First, we establish some connections between property testing and problems in learning theory. Next, we focus on testing graph properties, and devise algorithms to test whether a graph has properties such as being kcolorable or having a aeclique (clique of density ae
Primaldual algorithms for combinatorial optimization problems
, 2007
"... Combinatorial optimization problems such as routing, scheduling, covering and packing problems abound in everyday life. At a very high level, a combinatorial optimization problem amounts to finding a solution with minimum or maximum cost among a large number of feasible solutions. An algorithm for a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
is compared to the cost of a dual solution. In this dissertation we study the primaldual schema in the design of approximation algorithms for a number of covering and scheduling problems.
Results 1  10
of
1,415,377