207 search results - page 27 / 42 » Improved Approximation Algorithm for Connected Facility Loca... |
STOC
2009
ACM
16 years 8 days 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,...
100
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
78
Voted
FOCS
1996
IEEE
15 years 3 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
BMCBI
2008
14 years 11 months ago
2008
Background: Prediction of disulfide bridges from protein sequences is useful for characterizing structural and functional properties of proteins. Several methods based on differen...
107
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— Mobile ad hoc networking allows nodes to form temporary networks and communicate with each other possibly via multiple hops. By using a special node called the gateway, an ad h...