1671 search results - page 112 / 335 » On the Covering Steiner Problem |
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
108
Voted
ANTS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ï...
112
Voted
FUN
2007
Springer
15 years 4 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
107
Voted
ICML
1998
IEEE
15 years 4 months ago
1998
IEEE
Many systems that learn from examples express the learned concept as a disjunction. Those disjuncts that cover only a few examples are referred to as small disjuncts. The problem ...
89
Voted
PERCOM
2009
ACM
15 years 7 months ago
2009
ACM
—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WS...