3874 search results - page 215 / 775 » Approximation Algorithms for k-hurdle Problems |
181
click to vote
SODA
2007
ACM
15 years 5 months ago
2007
ACM
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
135
click to vote
JCO
2011
14 years 10 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
153
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
115
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
138
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...