1279 search results - page 24 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
128
Voted
SODA
2012
ACM
13 years 4 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
119
click to vote
MP
1998
15 years 1 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
113
click to vote
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
123
Voted
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
101
click to vote
SIAMCOMP
2010
14 years 8 months ago
2010
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...