Sciweavers

7150 search results - page 40 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
124
Voted
WADS
2007
Springer
189views Algorithms» more  WADS 2007»
15 years 6 months ago
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
Lukasz Kowalik, Marcin Mucha
86
Voted
IPL
2006
101views more  IPL 2006»
15 years 14 days ago
An efficient approximation for the Generalized Assignment Problem
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
Reuven Cohen, Liran Katzir, Danny Raz
107
Voted
NIPS
2008
15 years 1 months ago
Structured ranking learning using cumulative distribution networks
Ranking is at the heart of many information retrieval applications. Unlike standard regression or classification in which we predict outputs independently, in ranking we are inter...
Jim C. Huang, Brendan J. Frey
79
Voted
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
16 years 27 days ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
SIAMMAX
2010
164views more  SIAMMAX 2010»
14 years 7 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu