Results 1  10
of
112,376
Nodeweighted Network Design in Planar and Minorclosed Families of Graphs
"... We consider nodeweighted network design in planar and minorclosed families of graphs. In particular we focus on the edgeconnectivity survivable network design problem (ECSNDP). The input consists of a nodeweighted undirected graph G = (V, E) and integral connectivity requirements r(uv) for ea ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We consider nodeweighted network design in planar and minorclosed families of graphs. In particular we focus on the edgeconnectivity survivable network design problem (ECSNDP). The input consists of a nodeweighted undirected graph G = (V, E) and integral connectivity requirements r
PrimalDual Approximation Algorithms for Feedback Problems in Planar Graphs
 IPCO '96
, 1996
"... Given a subset of cycles of a graph, we consider the problem of finding a minimumweight set of vertices that meets all cycles in the subset. This problem generalizes a number of problems, including the minimumweight feedback vertex set problem in both directed and undirected graphs, the subset fee ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
. This results in 9/4approximation algorithms for the aforementioned feedback and bipartization problems in planar graphs. Our algorithms use the primaldual method for approximation algorithms as given in Goemans and Williamson [16]. We also show that our results have an interesting bearing on a conjecture
NodeWeighted Steiner Tree and Group Steiner Tree in Planar Graphs
"... Abstract. We improve the approximation ratios for two optimization problems in planar graphs. For nodeweighted Steiner tree, a classical networkoptimization problem, the best achievable approximation ratio in general graphs is Θ(log n), and nothing better was previously known for planar graphs. We ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
Abstract. We improve the approximation ratios for two optimization problems in planar graphs. For nodeweighted Steiner tree, a classical networkoptimization problem, the best achievable approximation ratio in general graphs is Θ(log n), and nothing better was previously known for planar graphs
Factor Graphs and the SumProduct Algorithm
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1998
"... A factor graph is a bipartite graph that expresses how a "global" function of many variables factors into a product of "local" functions. Factor graphs subsume many other graphical models including Bayesian networks, Markov random fields, and Tanner graphs. Following one simple c ..."
Abstract

Cited by 1787 (72 self)
 Add to MetaCart
computational rule, the sumproduct algorithm operates in factor graphs to computeeither exactly or approximatelyvarious marginal functions by distributed messagepassing in the graph. A wide variety of algorithms developed in artificial intelligence, signal processing, and digital communications can
Online Nodeweighted Steiner . . .
"... We obtain the first online algorithms for the nodeweighted Steiner tree, Steiner forest and group Steiner tree problems that achieve a polylogarithmic competitive ratio. Our algorithm for the Steiner tree problem runs in polynomial time, while those for the other two problems take quasipolynomia ..."
Abstract
 Add to MetaCart
We obtain the first online algorithms for the nodeweighted Steiner tree, Steiner forest and group Steiner tree problems that achieve a polylogarithmic competitive ratio. Our algorithm for the Steiner tree problem runs in polynomial time, while those for the other two problems take quasi
Prizecollecting Survivable Network Design in Nodeweighted Graphs
"... We consider nodeweighted network design problems, in particular the survivable network design problem (SNDP) and its prizecollecting version (PCSNDP). The input consists of a nodeweighted undirected graph G = (V, E) and integral connectivity requirements r(st) for each pair of nodes st. The go ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We consider nodeweighted network design problems, in particular the survivable network design problem (SNDP) and its prizecollecting version (PCSNDP). The input consists of a nodeweighted undirected graph G = (V, E) and integral connectivity requirements r(st) for each pair of nodes st
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
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Results 1  10
of
112,376