𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomial time algorithm for the Radon number of grids in the geodetic convexity

✍ Scribed by Dourado, Mitre Costa; Rautenbach, Dieter; Pereira de Sá, Vinícius Gusmão; Szwarcfiter, Jayme Luiz

Book ID
123222087
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
310 KB
Volume
44
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the geodetic Radon number of grids
On the geodetic Radon number of grids
✍ Mitre Costa Dourado; Dieter Rautenbach; Vinícius Gusmão Pereira de Sá; Jayme Lui 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 317 KB
Efficient Algorithms for Finding the Max
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
✍ Wun-Tat Chan; Francis Y.L. Chin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 366 KB

In a rectangular grid, given two sets of nodes, S S sources and T T sinks , of size 2 Ž . each, the disjoint paths DP problem is to connect as many nodes in S S to the Ž nodes in T T using a set of ''disjoint'' paths. Both edge-disjoint and ¨ertex-disjoint . cases are considered in this paper. Note

Polynomial time algorithms for minimizin
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
✍ Philippe Baptiste 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 102 KB 👁 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t