Sciweavers

CORR
2011
Springer
179views Education» more  CORR 2011»
13 years 2 months ago
Approximating minimum-power edge-multicovers
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...
Nachshon Cohen, Zeev Nutov
ENDM
2007
93views more  ENDM 2007»
13 years 11 months ago
Measurable sets with excluded distances
For a set of distances D = {d1, . . . , dk} a set A is called D-avoiding if no pair of points of A is at distance di for some i. We show that the density of A is exponentially sma...
Boris Bukh