Results 1  10
of
230,876
Bicriteria Network Design via Iterative Rounding
"... We study the edgeconnectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)approximation algorithm for this problem, by extending a linear programming based technique of iterative rounding. Previously, a (4, 4)approximat ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study the edgeconnectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)approximation algorithm for this problem, by extending a linear programming based technique of iterative rounding. Previously, a (4, 4
Prizecollecting Steiner networks via iterative rounding
 in Proceedings of The 9th Latin American Theoretical Informatics Symposium (LATIN
, 2010
"... Abstract. In this paper we design an iterative rounding approach for the classic prizecollecting Steiner forest problem and more generally the prizecollecting survivable Steiner network design problem. We show as an structural result that in each iteration of our algorithm there is an LP variable ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. In this paper we design an iterative rounding approach for the classic prizecollecting Steiner forest problem and more generally the prizecollecting survivable Steiner network design problem. We show as an structural result that in each iteration of our algorithm there is an LP variable
Iterative Rounding for MultiObjective Optimization Problems
"... In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate that by considering the multiobjective versions of three basic optimization problems: spanning tree, matroid basis and matc ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate that by considering the multiobjective versions of three basic optimization problems: spanning tree, matroid basis
An Iterative Rounding 2Approximation Algorithm for the Element Connectivity Problem
 In 42nd Annual IEEE Symposium on Foundations of Computer Science
, 2001
"... In the edge connected version of this problem (ECSNDP), these paths must be edgedisjoint. In the vertex connected version of the problem (VCSNDP), the paths must be vertex disjoint. Jain et al. [12] propose a version of the problem intermediate in difficulty to these two, called the element conne ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
by a path in the network. These variants of SNDP are all known to be NPhard. The best known approximation algorithm for the ECSNDP has performance guarantee of 2 (due to Jain [11]), and iteratively rounds solutions to a linear programming relaxation of the problem. ELC has a primal
An iterative method for the solution of the eigenvalue problem of linear differential and integral
, 1950
"... The present investigation designs a systematic method for finding the latent roots and the principal axes of a matrix, without reducing the order of the matrix. It is characterized by a wide field of applicability and great accuracy, since the accumulation of rounding errors is avoided, through the ..."
Abstract

Cited by 525 (0 self)
 Add to MetaCart
The present investigation designs a systematic method for finding the latent roots and the principal axes of a matrix, without reducing the order of the matrix. It is characterized by a wide field of applicability and great accuracy, since the accumulation of rounding errors is avoided, through
Iterative decoding of binary block and convolutional codes
 IEEE Trans. Inform. Theory
, 1996
"... Abstract Iterative decoding of twodimensional systematic convolutional codes has been termed “turbo ” (de)coding. Using loglikelihood algebra, we show that any decoder can he used which accepts soft inputsincluding a priori valuesand delivers soft outputs that can he split into three terms: the ..."
Abstract

Cited by 600 (43 self)
 Add to MetaCart
Abstract Iterative decoding of twodimensional systematic convolutional codes has been termed “turbo ” (de)coding. Using loglikelihood algebra, we show that any decoder can he used which accepts soft inputsincluding a priori valuesand delivers soft outputs that can he split into three terms
Iterative Rounding 2Approximation Algorithms for MinimumCost Vertex Connectivity Problems
 J. Comput. Syst. Sci
, 2002
"... The survivable network design problem (SNDP) is the following problem: given an undirected graph and values r ij for each pair of vertices i and j, find a minimumcost subgraph such that there are r ij disjoint paths between vertices i and j. In the edge connected version of this problem (ECSNDP) ..."
Abstract

Cited by 44 (0 self)
 Add to MetaCart
The survivable network design problem (SNDP) is the following problem: given an undirected graph and values r ij for each pair of vertices i and j, find a minimumcost subgraph such that there are r ij disjoint paths between vertices i and j. In the edge connected version of this problem (ECSNDP) , these paths must be edgedisjoint. In the vertex connected version of the problem (VCSNDP), the paths must be vertex disjoint. The element connectivity problem (ELCSNDP, or ELC) is a problem of intermediate difficulty.
Iterative rounding approximation algorithms for degreebounded nodeconnectivity network design
 in FOCS
, 2012
"... Abstract. We consider the problem of finding a minimum edge cost subgraph of a graph satisfying both given nodeconnectivity requirements and degree upper bounds on nodes. We present an iterative rounding algorithm of the biset LP relaxation for this problem. For directed graphs and koutconnectivi ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. We consider the problem of finding a minimum edge cost subgraph of a graph satisfying both given nodeconnectivity requirements and degree upper bounds on nodes. We present an iterative rounding algorithm of the biset LP relaxation for this problem. For directed graphs and k
Results 1  10
of
230,876