101 search results - page 18 / 21 » Domination Problems in Nowhere-Dense Classes |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
IPSN
2007
Springer
14 years 1 months ago
2007
Springer
Large-scale sensor network applications require in-network processing and data fusion to compute statistically relevant summaries of the sensed measurements. This paper studies di...
ICS
2000
Tsinghua U.
13 years 11 months ago
2000
Tsinghua U.
Complete system simulation to understand the influence of architecture and operating systems on application execution has been identified to be crucial for systems design. While t...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
AAIM
2009
Springer
14 years 1 months ago
2009
Springer
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...