3875 search results - page 146 / 775 » Approximation algorithms for the 0-extension problem |
139
click to vote
SIAMJO
2008
15 years 3 months ago
2008
A class of trust-region algorithms is developed and analyzed for the solution of minimization problems with nonlinear inequality constraints. Based on composite-step trust region ...
153
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
142
click to vote
AAAI
2010
15 years 6 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
189
click to vote
DCG
2010
15 years 4 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
143
click to vote
WEA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...