4843 search results - page 323 / 969 » The Shortcut Problem - Complexity and Approximation |
149
click to vote
SIAMDM
2010
14 years 11 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
126
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
184
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
140
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Artificial neural networks (ANNs) have been successfully applied to solve a variety of classification and function approximation problems. Although ANNs can generally predict bett...
166
Voted
SIAMJO
2002
15 years 3 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...