982 search results - page 92 / 197 » Solving Steiner tree problems in graphs to optimality |
100
Voted
FUIN
2006
15 years 21 days ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
102
click to vote
ICIP
2001
IEEE
16 years 2 months ago
2001
IEEE
Optimal mode selection for video coding is important in minimizing visual distortion given a rate constraint, and it has been studied in the literature using a single previous mac...
115
click to vote
INFOVIS
2002
IEEE
15 years 5 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
139
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
220
click to vote
NLP
2000
15 years 4 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...