1279 search results - page 80 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
STOC
2001
ACM
14 years 9 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
FSTTCS
1993
Springer
14 years 27 days ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
PAMI
2007
13 years 8 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
WEA
2007
Springer
14 years 2 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...