4843 search results - page 256 / 969 » The Shortcut Problem - Complexity and Approximation |
153
Voted
WAOA
2010
Springer
15 years 1 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 ...
140
Voted
CDC
2010
IEEE
14 years 10 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 ...
225
click to vote
NA
2011
14 years 10 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...
173
Voted
ICDT
2011
ACM
14 years 7 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...
255
Voted
ICDE
2003
IEEE
16 years 5 months ago
2003
IEEE
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or...