𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New algorithms for special cases of the hidden line elimination problem

✍ Scribed by Ralf Hartmut Güting; Thomas Ottmann

Publisher
Elsevier Science
Year
1987
Weight
91 KB
Volume
38
Category
Article
ISSN
0734-189X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient special case algorithms for th
Efficient special case algorithms for the n-line planar traveling salesman problem
✍ M. Cutler 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

## Abstract The traveling salesman problem, path, or cycle is NP‐complete. All known exact solutions to this problem are exponential. In the __N‐line planar__ traveling salesman problem the points are on __N__ lines in the plane. In this paper, simple and efficient low‐degree polynomial solutions a

New On-Line Algorithms for the Page Repl
New On-Line Algorithms for the Page Replication Problem
✍ Susanne Albers; Hisashi Koga 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 210 KB

We present improved competitive on-line algorithms for the page replication problem and concentrate on important network topologies for which algorithms with a constant competitive ratio can be given. We develop an optimal randomized on-line replication algorithm for trees and uniform networks; its

A branch & cut algorithm for the windy g
A branch & cut algorithm for the windy general routing problem and special cases
✍ Angel Corberán; Isaac Plana; José M. Sanchis 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

## Abstract In this paper, we present an exact algorithm for the Windy General Routing Problem. This problem generalizes many important Arc Routing Problems and also has some interesting real‐life applications. The Branch & Cut method presented here is based on a cutting‐plane algorithm that identi