Sciweavers

7150 search results - page 36 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
129
Voted
ECCC
2006
109views more  ECCC 2006»
15 years 15 days ago
How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments
Suppose you ran a chess tournament, everybody played everybody, and you wanted to use the results to rank everybody. Unless you were really lucky, the results would not be acyclic...
Claire Kenyon-Mathieu, Warren Schudy
105
Voted
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 13 days ago
Relative-Error CUR Matrix Decompositions
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
111
Voted
MP
2010
172views more  MP 2010»
14 years 11 months ago
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
Simai He, Zhening Li, Shuzhong Zhang
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 3 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
94
Voted
CCCG
2006
15 years 1 months ago
An Improved Approximation Factor For The Unit Disk Covering Problem
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on th...
Sada Narayanappa, Petr Vojtechovský