909 search results - page 87 / 182 » On the approximability of some network design problems |
169
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
158
click to vote
PRIMA
2009
Springer
16 years 24 days ago
2009
Springer
Abstract. We have developed a new two-sided matching protocol including job applicants and employers in the condition that applicants have conditional preferences and well informed...
139
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
158
click to vote
MLDM
2008
Springer
15 years 6 months ago
2008
Springer
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
168
click to vote
IWCMC
2006
ACM
16 years 6 days ago
2006
ACM
An overview of some recent advances in distributed information processing for control over wireless sensor networks is presented in this paper. Firstly, a taxonomy of fundamental ...