3875 search results - page 113 / 775 » Approximation algorithms for the 0-extension problem |
183
click to vote
JMLR
2012
13 years 7 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
170
click to vote
CPM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
145
click to vote
SECON
2007
IEEE
15 years 10 months ago
2007
IEEE
Base station location has significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particular challenging as we need ...
156
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
137
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...