534 search results - page 24 / 107 » Tight approximation algorithm for connectivity augmentation ... |
112
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
112
Voted
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
110
click to vote
SIGIR
1998
ACM
15 years 6 months ago
1998
ACM
This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic. Connectivity...
136
click to vote
SIAMSC
2008
15 years 2 months ago
2008
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
111
click to vote
ALDT
2009
Springer
15 years 9 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...