1814 search results - page 32 / 363 » Improved Results on Geometric Hitting Set Problems |
178
click to vote
APPROX
2009
Springer
16 years 18 days ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
142
click to vote
CALCO
2007
Springer
16 years 5 days ago
2007
Springer
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
207
click to vote
TSMC
2010
15 years 21 days ago
2010
Feature-based image watermarking schemes, which aim to survive various geometric distortions, have attracted great attention in recent years. Existing schemes have shown robustness...
193
click to vote
FOCS
2006
IEEE
16 years 2 days ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
JSYML
2002
15 years 5 months ago
2002
Abstract. We prove some results related to the problem of blowing up the power set of the least measurable cardinal. Our forcing results improve those of [1] by using the optimal h...