✦ LIBER ✦

On the parameterized complexity of the Multi-MCT and Multi-MCST problems

✍ Scribed by Wenbin Chen; Matthew C. Schmidt; Nagiza F. Samatova

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 244 KB
Volume: 21
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-009-9220-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of finding multi-const

On the complexity of finding multi-constrained spanning trees

✍ P.M. Camerini; G. Galbiati; F. Maffioli 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 602 KB

On the parameterized complexity of short

On the parameterized complexity of short computation and factorization

✍ Liming Cai; Jianer Chen; Rodney G. Downey; Michael R. Fellows 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 169 KB

On the weighted elliptic problems involv

On the weighted elliptic problems involving multi-singular potentials and multi-critical exponents

✍ Dong Sheng Kang 📂 Article 📅 2009 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 240 KB

On the parameterized complexity of the f

On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems

✍ Krzysztof Pietrzak 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 205 KB

We show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet longest common subsequence (LCS) problems parameterized in the number of strings are W ½1-hard. Unless W ½1 ¼ FPT; this rules out the existence of algorithms with time complexity of Oð f ðkÞn a Þ for those pro

Complexity of the job insertion problem

Complexity of the job insertion problem in multi-stage scheduling

✍ Arjen P.A. Vestjens; Marc Wennink; Gerhard J. Woeginger 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 127 KB

The complexity of the computation of the

The complexity of the computation of the global extremum in a class of multi-extremum problems

✍ A.G. Perevozchikov 📂 Article 📅 1990 🏛 Elsevier Science ⚖ 464 KB