1671 search results - page 115 / 335 » On the Covering Steiner Problem |
128
click to vote
WALCOM
2007
IEEE
15 years 2 months ago
2007
IEEE
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
114
click to vote
EVOW
2007
Springer
15 years 4 months ago
2007
Springer
RND (Radio Network Design) is a Telecommunication problem consisting in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest co...
99
Voted
CORR
2006
Springer
15 years 1 months ago
2006
Springer
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
113
Voted
COMPGEOM
2009
ACM
15 years 7 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
138
click to vote
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...