105 search results - page 5 / 21 » Improved approximation algorithms for minimum-weight vertex ... |
157
Voted
TCC
2007
Springer
15 years 12 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
180
Voted
FOCS
2008
IEEE
16 years 8 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
162
Voted
CORR
2006
Springer
15 years 5 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
153
Voted
ICANN
2007
Springer
15 years 12 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
171
click to vote
WADS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...