Results 1  10
of
1,207,947
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
to at most b(v) edges in H. We give the first (O(1), O(1) ยท b(v)) bicriteria approximation algorithms for the degreebounded SNDP problem with element connectivity requirements and for several degreebounded SNDP problems with vertex connectivity requirements. Our algorithms construct a subgraph H whose
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 koutconnectivity
ADDITIVE GUARANTEES FOR DEGREEBOUNDED DIRECTED NETWORK DESIGN
, 2009
"... We present polynomialtime approximation algorithms for some degreebounded directed network design problems. Our main result is for intersecting supermodular connectivity requirements with degree bounds: given a directed graph G =(V, E) with nonnegative edgecosts, a connectivity requirement specif ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
We present polynomialtime approximation algorithms for some degreebounded directed network design problems. Our main result is for intersecting supermodular connectivity requirements with degree bounds: given a directed graph G =(V, E) with nonnegative edgecosts, a connectivity requirement
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
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
Probabilistic Routing in Intermittently Connected Networks
 SIGMOBILE Mobile Computing and Communication Review
, 2004
"... In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does ..."
Abstract

Cited by 633 (6 self)
 Add to MetaCart
In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts
Approximation Algorithms for Connected Dominating Sets
 Algorithmica
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, whe ..."
Abstract

Cited by 376 (9 self)
 Add to MetaCart
, where the graph induced by vertices in the dominating set is required to be connected as well. This problem arises in network testing, as well as in wireless communication. Two polynomial time algorithms that achieve approximation factors of O(H (\Delta)) are presented, where \Delta is the maximum
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
Approximate Signal Processing
, 1997
"... It is increasingly important to structure signal processing algorithms and systems to allow for trading off between the accuracy of results and the utilization of resources in their implementation. In any particular context, there are typically a variety of heuristic approaches to managing these tra ..."
Abstract

Cited by 516 (2 self)
 Add to MetaCart
number of ideas and approaches to approximate processing as currently being formulated in the computer science community. We then present four examples of signal processing algorithms/systems that are structured with these goals in mind. These examples may be viewed as partial inroads toward the ultimate
Results 1  10
of
1,207,947