✦ LIBER ✦

Improved optimization modelling for the closest string and related problems

✍ Scribed by Peter Zörnig

Book ID: 108057216
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 289 KB
Volume: 35
Category: Article
ISSN: 0307-904X
DOI: 10.1016/j.apm.2011.05.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved LP-based algorithms for the clo

Improved LP-based algorithms for the closest string problem

✍ F. Della Croce; F. Salassa 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 122 KB

The ultraweak time coupling in non-linea

The ultraweak time coupling in non-linear multiphysics modelling and related optimization problems

✍ Y. Favennec; V. Labbé; F. Bay 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

An Optimized Divide-and-Conquer Algorith

An Optimized Divide-and-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

✍ Pereira, José C.; Lobo, Fernando G. 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 833 KB

Optimal Bounds for the Predecessor Probl

Optimal Bounds for the Predecessor Problem and Related Problems

✍ Paul Beame; Faith E. Fich 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 269 KB

We obtain matching upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed compactly stored set. Our algorithms are for the unit-cost word RAM with multiplication and are extended to give dynamic algorithms. The lower bounds are proved f

Boundary-value problems for the string e

Boundary-value problems for the string equation, the Poncelet problem, and the Pell-Abel equation: Links and relations

✍ V. P. Burskii; A. S. Zhedanov 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 110 KB

Optimization models and algorithms for t

Optimization models and algorithms for the hyperplane clustering problem

✍ Kanika Dhyani 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 93 KB