In this paper we deal with an NP-hard combinatorial optimization problem, the k-cardinality tree problem in node-weighted graphs. This problem has several applications, which justify the need for e cient methods to obtain good solutions. We review existing literature on the problem. Then we prove th
✦ LIBER ✦
Local search for the generalized tree alignment problem
✍ Scribed by Andrés Varón, Ward C Wheeler
- Book ID
- 120675289
- Publisher
- BioMed Central
- Year
- 2013
- Tongue
- English
- Weight
- 257 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1471-2105
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Local search algorithms for the k-cardin
✍
Christian Blum; Matthias Ehrgott
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 463 KB
The tree alignment problem
✍
Andrés Varón, Ward C Wheeler
📂
Article
📅
2012
🏛
BioMed Central
🌐
English
⚖ 761 KB
Efficient Algorithms for Local Alignment
✍
S. Rajasekaran; H. Nick; P.M. Pardalos; S. Sahni; G. Shaw
📂
Article
📅
2001
🏛
Springer US
🌐
English
⚖ 41 KB
Local search techniques for the generali
✍
Scott E. Sampson; Elliott N. Weiss
📂
Article
📅
1993
🏛
John Wiley and Sons
🌐
English
⚖ 665 KB
In this article we address the problem of scheduling a single project network with both precedence and resource constraints through the use of a local search technique. We choose a solution definition which guarantees precedence feasibility, allowing the procedure to focus on overcoming resource inf
Tree search for the stacking problem
✍
Rui Rei,João Pedro Pedroso
📂
Article
📅
2012
🏛
Springer US
🌐
English
⚖ 881 KB
AVL-trees for localized search
✍
Athanasios K. Tsakalidis
📂
Article
📅
1985
🏛
Elsevier Science
⚖ 838 KB