Results 1  10
of
615
Improved algorithm for degree bounded survivable network design problem
 In SWAT
, 2010
"... Abstract. We consider the DegreeBounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. We consider the DegreeBounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present
Improved Algorithm for Degree Bounded Survivable Network Design Problem
, 2009
"... We consider the DegreeBounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present an algorit ..."
Abstract
 Add to MetaCart
We consider the DegreeBounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present
A Tight Bound on Approximating Arbitrary Metrics by Tree Metrics
 In Proceedings of the 35th Annual ACM Symposium on Theory of Computing
, 2003
"... In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This improves upon the result of Bartal who gave a bound of O(log n log log n). Moreover, our result is existentially tight; t ..."
Abstract

Cited by 306 (8 self)
 Add to MetaCart
; there exist metric spaces where any tree embedding must have distortion#sto n)distortion. This problem lies at the heart of numerous approximation and online algorithms including ones for group Steiner tree, metric labeling, buyatbulk network design and metrical task system. Our result improves
Additive Approximation for Bounded Degree Survivable Network Design
 STOC'08
, 2008
"... We study a general network design problem with additional degree constraints. Given connectivity requirements ruv for all pairs of vertices, a Steiner network is a graph in which there are at least r_uv edgedisjoint paths between u and v for all pairs of vertices u, v. In the MINIMUM BOUNDEDDEGREE ..."
Abstract

Cited by 29 (5 self)
 Add to MetaCart
We study a general network design problem with additional degree constraints. Given connectivity requirements ruv for all pairs of vertices, a Steiner network is a graph in which there are at least r_uv edgedisjoint paths between u and v for all pairs of vertices u, v. In the MINIMUM BOUNDEDDEGREE
Survivable network design with degree or order constraints
 SIAM J. ON COMPUTING
, 2009
"... We present algorithmic and hardness results for network design problems with degree or order constraints. The first problem we consider is the Survivable Network Design problem with degree constraints on vertices. The objective is to find a minimum cost subgraph which satisfies connectivity requir ..."
Abstract

Cited by 61 (7 self)
 Add to MetaCart
requirements between vertices and also degree upper bounds Bv on the vertices. This includes the wellstudied Minimum Bounded Degree Spanning Tree problem as a special case. Our main result is a (2, 2Bv +3)approximation algorithm for the edgeconnectivity Survivable Network Design problem with degree
Additive Approximation for Bounded DegreeSurvivable Network Design
"... ABSTRACT We study a general network design problem with additional degreeconstraints. Given connectivity requirements ruv for all pairs ofvertices, a Steiner network is a graph in which there are at least ruv edgedisjoint paths between u and v for all pairs of vertices u, v. In the MINIMUM BOUNDED ..."
Abstract
 Add to MetaCart
ABSTRACT We study a general network design problem with additional degreeconstraints. Given connectivity requirements ruv for all pairs ofvertices, a Steiner network is a graph in which there are at least ruv edgedisjoint paths between u and v for all pairs of vertices u, v. In the MINIMUM BOUNDEDDEGREE
Improved Approximation Algorithms for Network Design Problems
, 1994
"... We consider a class of network design problems in which one needs to find a minimumcost network satisfying certain connectivity requirements. For example, in the survivable network design problem, the requirements specify that there should be at least r(v; w) edgedisjoint paths between each pai ..."
Abstract

Cited by 96 (11 self)
 Add to MetaCart
We consider a class of network design problems in which one needs to find a minimumcost network satisfying certain connectivity requirements. For example, in the survivable network design problem, the requirements specify that there should be at least r(v; w) edgedisjoint paths between each
Improved Approximation Algorithms for Degreebounded Network Design Problems with Node Connectivity Requirements
"... We consider degree bounded network design problems with element and vertex connectivity requirements. In the degree bounded Survivable Network Design (SNDP) problem, the input is an undirected graph G = (V,E) with weights w(e) on the edges and degree bounds b(v) on the vertices, and connectivity r ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider degree bounded network design problems with element and vertex connectivity requirements. In the degree bounded Survivable Network Design (SNDP) problem, the input is an undirected graph G = (V,E) with weights w(e) on the edges and degree bounds b(v) on the vertices, and con
On Generalizations of Network Design Problems with Degree Bounds
"... Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1) by handling more complex degree constraints in the minimum s ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
spanning tree problem (namely laminar crossing spanning tree), and (2) by incorporating ‘degree bounds ’ in other combinatorial optimization problems such as matroid intersection and lattice polyhedra. We give new or improved approximation algorithms, hardness results, and integrality gaps
An Efficient Approximation Algorithm for the Survivable Network Design Problem
 IN PROCEEDINGS OF THE THIRD MPS CONFERENCE ON INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION
, 1993
"... The survivable network design problem is to construct a minimumcost subgraph satisfying certain given edgeconnectivity requirements. The first polynomialtime approximation algorithm was given by Williamson et al. [20]. This paper gives an improved version that is more efficient. Consider a graph ..."
Abstract

Cited by 56 (6 self)
 Add to MetaCart
The survivable network design problem is to construct a minimumcost subgraph satisfying certain given edgeconnectivity requirements. The first polynomialtime approximation algorithm was given by Williamson et al. [20]. This paper gives an improved version that is more efficient. Consider a graph
Results 1  10
of
615