✦ LIBER ✦

A dual algorithm for the satisfiability problem

✍ Scribed by Yoshihiro Tanaka

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 647 KB
Volume: 37
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90139-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On approximation algorithms for the mini

On approximation algorithms for the minimum satisfiability problem

✍ M.V. Marathe; S.S. Ravi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 617 KB

A primal-dual algorithm for the capacita

A primal-dual algorithm for the capacitated Hitchcock problem

✍ L. R. Ford Jr.; D. R. Fulkerson 📂 Article 📅 1957 🏛 John Wiley and Sons 🌐 English ⚖ 293 KB 👁 1 views

A dual algorithm for the constrained sho

A dual algorithm for the constrained shortest path problem

✍ Gabriel Y. Handler; Israel Zang 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 878 KB

A primal-dual approximation algorithm fo

A primal-dual approximation algorithm for the Steiner forest problem

✍ R. Ravi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 502 KB

A linear time algorithm for unique Horn

A linear time algorithm for unique Horn satisfiability

✍ Daniele Pretolani 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 563 KB

Dual algorithms for the shortest path tr

Dual algorithms for the shortest path tree problem

✍ Pallottino, Stefano; Scutell�, Maria Grazia 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB 👁 2 views

We consider dual approaches for the Shortest Path Tree problem. After a brief introduction to the problem, we review the most important dual algorithms which have been described in the literature for its solution and propose a new family of dual ascent algorithms. In these algorithms, ''local'' and