✦ LIBER ✦

An improved algorithm for the rectangle enclosure problem

✍ Scribed by D.T Lee; F.P Preparata

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 367 KB
Volume: 3
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(82)90021-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Data structures for the rectangle contai

Data structures for the rectangle containment and enclosure problems

✍ Vijay Vaishnavi; Derick Wood 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 942 KB

An Improved Algorithm for the Traveler′s

An Improved Algorithm for the Traveler′s Problem

✍ A. Aggarwal; T. Tokuyama 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 581 KB

An improved algorithm for the planar 3-c

An improved algorithm for the planar 3-cut problem

✍ Xin He 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 838 KB

An improved lexicographic search algorit

An improved lexicographic search algorithm for the flowshop scheduling problem

✍ Jatinder N.D. Gupta 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 263 KB

An improved parallel algorithm for 0/1 k

An improved parallel algorithm for 0/1 knapsack problem

✍ Gen-Huey Chen; Jin-Hwang Jang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 870 KB

An improved approximation algorithm for

An improved approximation algorithm for the partial Latin square extension problem

✍ Carla P. Gomes; Rommel G. Regis; David B. Shmoys 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 203 KB

The problem of completing partial latin squares arises in a number of applications, including conflict-free wavelength routing in wide-area optical networks, statistical designs, and error-correcting codes. A partial latin square is an n by n array such that each cell is either empty or contains exa