791 search results - page 38 / 159 » Approximating the Maximum Sharing Problem |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
The 1 norm regularized least square technique has been proposed as an efficient method to calculate sparse solutions. However, the choice of the regularization parameter is still...
INFOCOM
2000
IEEE
14 years 1 days ago
2000
IEEE
Abstract—We investigate the problem of providing a fair bandwidth allocation to each of flows that share the outgoing link of a congested router. The buffer at the outgoing link...
WABI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
ALGORITHMICA
2006
13 years 7 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
IPL
2000
13 years 7 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...