7006 search results - page 343 / 1402 » Approximation Algorithms |
136
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
161
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
136
click to vote
APPROX
2004
Springer
15 years 9 months ago
2004
Springer
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
141
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
136
click to vote
JEA
2008
15 years 4 months ago
2008
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome e...