796 search results - page 17 / 160 » Approximating the centroid is hard |
STOC
2005
ACM
14 years 7 months ago
2005
ACM
We show that there is no log log M log log log M -approximation for the undirected congestion minimization problem unless NP ZPTIME(npolylog n ), where M is the size of the grap...
DATE
2006
IEEE
14 years 1 months ago
2006
IEEE
The energy-aware design for electronic systems has been an important issue in hardware and/or software implementations, especially for embedded systems. This paper targets a synth...
ECCC
2007
13 years 7 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--In this paper, Bayesian hypothesis testing is investigated when the prior probabilities of the hypotheses, taken as a random vector, are quantized. Nearest neighbor and c...