7006 search results - page 153 / 1402 » Approximation Algorithms |
172
click to vote
ALGORITHMICA
1999
15 years 6 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
196
Voted
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
196
click to vote
IPL
2000
15 years 6 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
171
click to vote
RSFDGRC
2005
Springer
16 years 4 days ago
2005
Springer
In this paper, the concept of a granulation order is proposed in an information system. The positive approximation of a set under a granulation order is defined. Some properties o...
202
click to vote
DC
2008
15 years 6 months ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...