Sciweavers

192 search results - page 12 / 39
» A Constant-Factor Approximation Algorithm for the Multicommo...
Sort
View
SODA
1992
ACM
179views Algorithms» more  SODA 1992»
13 years 9 months ago
Approximating the Minimum Weight Triangulation
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
David Eppstein
APPROX
2009
Springer
131views Algorithms» more  APPROX 2009»
14 years 3 months ago
An Approximation Scheme for Terrain Guarding
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R....
ICC
2008
IEEE
126views Communications» more  ICC 2008»
14 years 3 months ago
Joint Stream Control and Scheduling in Multihop Wireless Networks with MIMO Links
—MIMO links can significantly improve network throughput by supporting multiple concurrent data streams between a pair of nodes and suppressing wireless interference. In this pa...
Brendan Mumey, Jian Tang, Timothy Hahn
WWW
2011
ACM
13 years 3 months ago
Consideration set generation in commerce search
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
Sayan Bhattacharya, Sreenivas Gollapudi, Kamesh Mu...
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
13 years 10 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller