534 search results - page 11 / 107 » Tight approximation algorithm for connectivity augmentation ... |
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
STOC
2004
ACM
15 years 9 months ago
2004
ACM
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
83
Voted
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
JCSS
2010
14 years 8 months ago
2010
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
SIGMOD
2010
ACM
15 years 1 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...