743 search results - page 73 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
127
click to vote
KDD
2010
ACM
15 years 17 days ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
ESA
2003
Springer
15 years 7 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
120
Voted
STOC
2009
ACM
16 years 2 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
128
click to vote
CORR
2010
Springer
15 years 22 days ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
106
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...