✦ LIBER ✦

The worst case behavior of a greedy algorithm for a class of pseudo-Boolean functions

✍ Scribed by M.R. Emamy-K.

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 162 KB
Volume: 23
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(89)90018-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Worst case analysis of a greedy algorith

Worst case analysis of a greedy algorithm for graph thickness

✍ Sinichiro Kawano; Koichi Yamazaki 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 208 KB

In this paper, we consider a greedy algorithm for thickness of graphs. The greedy algorithm we consider here takes a maximum planar subgraph away from the current graph in each iteration and repeats this process until the current graph has no edge. The greedy algorithm outputs the number of iteratio

A class of generalized greedy algorithms

A class of generalized greedy algorithms for the multi-knapsack problem

✍ A.H.G. Rinnooy Kan; L. Stougie; C. Vercellis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 725 KB

An average case analysis of a greedy alg

An average case analysis of a greedy algorithm for the on-line Steiner tree problem

✍ Ying Teh Tsai; Chuan Yi Tang; Yunn Yen Chen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 719 KB

A worst-case analysis of two approximate

A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem

✍ Giovanni Righini; Marco Trubian 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 251 KB

An O(nm)-time algorithm for computing th

An O(nm)-time algorithm for computing the dual of a regular Boolean function

✍ Uri N. Peled; Bruno Simeone 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 924 KB

An algorithm for the computation of zero

An algorithm for the computation of zeros of a special class of entire functions

✍ M.R. Farmer; G. Loizou 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 748 KB