4894 search results - page 264 / 979 » The Guarding Problem - Complexity and Approximation |
168
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—The capacity region of multihop wireless network is involved in many capacity optimization problems. However, the membership of the capacity region is NP-complete in general, an...
208
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
184
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
286
click to vote
NA
2011
15 years 1 months ago
2011
We are interested in computing the Fermi-Dirac matrix function in which the matrix argument is the Hamiltonian matrix arising from Density Function Theory (DFT) applications. More...
232
click to vote
ICDT
2011
ACM
14 years 10 months ago
2011
ACM
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...