2137 search results - page 152 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
172
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
164
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
170
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
175
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
196
click to vote
PAMI
2007
15 years 5 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....