497 search results - page 90 / 100 » Approximating max-min linear programs with local algorithms |
IPCO
2010
14 years 11 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
STRINGOLOGY
2004
14 years 11 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
INFORMS
2000
14 years 9 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
TCOM
2010
14 years 8 months ago
2010
Abstract—This paper considers the problem of Gaussian symbols detection in MIMO systems in the presence of channel estimation errors. Under this framework we develop a computatio...
166
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...