Results 1  10
of
115,888
An Approximation Algorithm for MinimumCost VertexConnectivity Problems
, 1997
"... We present an approximation algorithm for solving graph problems in which a lowcost set of edges must be selected that has certain vertexconnectivity properties. In the survivable network design problem, one is given a value r ij for each pair of vertices i and j, and must find a minimumcost set ..."
Abstract

Cited by 55 (5 self)
 Add to MetaCart
We present an approximation algorithm for solving graph problems in which a lowcost set of edges must be selected that has certain vertexconnectivity properties. In the survivable network design problem, one is given a value r ij for each pair of vertices i and j, and must find a minimumcost set
An Approximation Algorithm for MinimumCost VertexConnectivity Problems
"... Abstract. We present an approximation algorithm for solving graph problems in which a lowcost set of edges must be selected that has certain vertexconnectivity properties, in the survivable network design problem, a value ri) for each pair of vertices i and j is given, and a minimumcost set of ed ..."
Abstract
 Add to MetaCart
Abstract. We present an approximation algorithm for solving graph problems in which a lowcost set of edges must be selected that has certain vertexconnectivity properties, in the survivable network design problem, a value ri) for each pair of vertices i and j is given, and a minimumcost set
Erratum: An Approximation Algorithm for MinimumCost VertexConnectivity Problems
, 2001
"... There is an error in our paper “An Approximation Algorithm for MinimumCost VertexConnectivity Problems, ” (Algorithmica (1997) 18:2143). In that paper we consider the following problem: given an undirected graph and values rij for each pair of vertices i and j, find a minimumcost set of edges s ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
There is an error in our paper “An Approximation Algorithm for MinimumCost VertexConnectivity Problems, ” (Algorithmica (1997) 18:2143). In that paper we consider the following problem: given an undirected graph and values rij for each pair of vertices i and j, find a minimumcost set of edges
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
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
Better Algorithms for Minimum Weight VertexConnectivity Problems
 in Proc. of STACS'97, L.N.C.S
, 1996
"... Given a k vertex connected graph with weighted edges, we study the problem of finding a minimum weight spanning subgraph which is k vertexconnected, for k = 2; 3; 4. The problem is known to be NPhard for any k, even when edges have no weight, and various approximation algorithms have been proposed ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Given a k vertex connected graph with weighted edges, we study the problem of finding a minimum weight spanning subgraph which is k vertexconnected, for k = 2; 3; 4. The problem is known to be NPhard for any k, even when edges have no weight, and various approximation algorithms have been
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
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 Viterbi algorithm
 Proceedings of the IEEE
, 1973
"... vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A ..."
Abstract

Cited by 985 (3 self)
 Add to MetaCart
vol. 6, no. 8, pp. 211220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 17651775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A799A804, 1964. [9] T. C. Mo, “Theory of electrodynamics in media in noninertial frames and applications, ” J. Math. Phys., vol. 11, pp. 25892610, 1970.
Results 1  10
of
115,888