✦ LIBER ✦

On some multicriteria arborescence problems: Complexity and algorithms

✍ Scribed by Mauro Dell'Amico; Francesco Maffioli

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 956 KB
Volume: 65
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00035-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of some arborescences

On the complexity of some arborescences finding problems on a multihop radio network

✍ Nen-Fu Huang; Tsing-Her Huang 📂 Article 📅 1989 🏛 Springer Netherlands 🌐 English ⚖ 284 KB

Algorithms and complexity in biological

Algorithms and complexity in biological pattern formation problems

✍ D. Grigoriev; S. Vakulenko 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 352 KB

Cardinality constrained minimum cut prob

Cardinality constrained minimum cut problems: complexity and algorithms

✍ Maurizio Bruglieri; Francesco Maffioli; Matthias Ehrgott 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 377 KB

In several applications the solutions of combinatorial optimization problems (COP) are required to satisfy an additional cardinality constraint, that is to contain a ÿxed number of elements. So far the family of (COP) with cardinality constraints has been little investigated. The present work tackle

The complexity of some polynomial networ

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

✍ Alan K. Mackworth; Eugene C. Freuder 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 475 KB

On the complexity of some algorithms of

On the complexity of some algorithms of matrix multiplication

✍ Valery B Alekseyev 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 712 KB

On the space complexity of some algorith

On the space complexity of some algorithms for sequence comparison

✍ Yuval Rabani; Zvi Galil 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 670 KB