𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cardinality constrained path covering problems in grid graphs

✍ Scribed by N. Apollonio; L. Caccetta; B. Simeone

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
207 KB
Volume
44
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Length-constrained path-matchings in gra
Length-constrained path-matchings in graphs
✍ M. Ghodsi; M. T. Hajiaghayi; M. Mahdian; V. S. Mirrokni πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 114 KB
Perfect path double covers in every simp
Perfect path double covers in every simple graph
✍ Hao Li πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 229 KB

## Abstract We prove in this paper that every simple graph __G__ admits a perfect path double cover (PPDC), i.e., a set of paths of __G__ such that each edge of __G__ belongs to exactly two of the paths and each vertex of __G__ is an end of exactly two of the paths, where a path of length zero is c

Using multiple searchers in constrained-
Using multiple searchers in constrained-path, moving-target search problems
✍ Robert F. Dell; James N. Eagle; Gustavo Henrique Alves Martins; Almir Garnier Sa πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 915 KB

The search theory open literature has paid little, if any, attention to the multiple-searcher, moving-target search problem. We develop an optimal branch-and-bound procedure and six heuristics for solving constrained-path problems with multiple searchers. Our optimal procedure outperforms existing a