Results 1  10
of
449,054
A primaldual approximation algorithm for generalized Steiner network problems
 Combinatorica
, 1995
"... M.I.T. We present the first polynomialtime approximation algorithm for finding a minimumcost subgraph having at least a specified number of edges in each cut. This class of problems includes, among others, the generalized Steiner network problem, also called the survivable network design problem. ..."
Abstract

Cited by 95 (19 self)
 Add to MetaCart
M.I.T. We present the first polynomialtime approximation algorithm for finding a minimumcost subgraph having at least a specified number of edges in each cut. This class of problems includes, among others, the generalized Steiner network problem, also called the survivable network design problem
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
New PrimalDual Algorithms for Steiner Tree Problems
"... We present new primaldual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree problem (DST), and the set cover problem (SC) which is a subcase of DST. All our problems are NPhard; so we are interested in ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We present new primaldual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree problem (DST), and the set cover problem (SC) which is a subcase of DST. All our problems are NPhard; so we are interested
A primaldual approximation algorithm for the Steiner forest problem
 INFORMATION PROCESSING LETTERS 50(4
, 1993
"... Given an undirected graph with nonnegative edgecosts, a subset of nodes of size k called the terminals, and an integer q between 1 and k, the minimum qSteiner forest problem is to find a forest of minimum cost with at most q trees that spans all the terminals. When q = 1, we have the classical ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
minimumcost Steiner tree problem on networks. In this note, we adapt a primaldual approximation algorithm for the latter problem due to Agrawal, Klein and Ravi to provide one for the former. The algorithm runs in time O(n log n +m) and outputs a solution of cost at most 2(1 \Gamma 1 k\Gammaq+1
A faster approximate minimum steiner tree algorithm & primaldual and . . .
, 2009
"... We prove matching upper and lower bounds for the Minimum Steiner Tree (MStT) problem within the adaptive priority stack model introduced by Borodin, Cashman, and Magen [2] and lower bounds within the adaptive priority queue model introduced here. These models, which are extensions of the adaptive pr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
priority model of Borodin, Nielson, and Rackoff [4], are said to capture reasonable primaldual and localratio extensions of greedy algorithms. Borodin etal. [2] had proved lower bound 11 3 on the approximation ratio obtainable for the problem in the stack model. We improve this to 2−O ( 1 V
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
factor approximation by using our primaldual algorithm for connected facility location. We generalize our results to an edge capacitated variant of these problems and give a constantfactor approximation for these variants.
Distributed primaldual approximation algorithms for network design problems
, 2009
"... We present a simple paradigm for efficient implementation of primaldual approximation algorithms for several network design problems in the distributed environment. Our approximation ratios are the same as in the centralized primaldual algorithms, and we establish that our message complexity is cl ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We present a simple paradigm for efficient implementation of primaldual approximation algorithms for several network design problems in the distributed environment. Our approximation ratios are the same as in the centralized primaldual algorithms, and we establish that our message complexity
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
Primaldual approximation algorithms for the PrizeCollecting Steiner Tree Problem
 Information Processing Letters
"... The primaldual scheme has been used to provide approximation algorithms for many problems. Goemans and Williamson gave a (2 − 1 n−1)approximation for the PrizeCollecting Steiner Tree Problem that runs in O(n3 logn) time. Their algorithm applies the primaldual scheme once for each of the n vertic ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
The primaldual scheme has been used to provide approximation algorithms for many problems. Goemans and Williamson gave a (2 − 1 n−1)approximation for the PrizeCollecting Steiner Tree Problem that runs in O(n3 logn) time. Their algorithm applies the primaldual scheme once for each of the n
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
Results 1  10
of
449,054