𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two algorithms for the subset interconnection design problem

✍ Scribed by Erich Prisner

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
516 KB
Volume
22
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation Algorithms for Network Des
Approximation Algorithms for Network Design Problems on Bounded Subsets
✍ Dorit S. Hochbaum; Joseph (Seffi) Naor πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 141 KB

We address the problem of designing a network so that certain connectivity requirements are satisfied, at minimum cost of the edges used. The requirements are specified for each subset of vertices in terms of the number of edges with one endpoint in the set. We address a class of such problems, wher

Two exact algorithms for the vehicle rou
Two exact algorithms for the vehicle routing problem on trees
✍ Pontien Mbaraga; AndrΓ© Langevin; Gilbert Laporte πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 80 KB πŸ‘ 2 views

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time-constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The othe

Design guidelines for a low-loss interco
Design guidelines for a low-loss interconnection between two strip lines
✍ Marat Davidovitz; Peter Franchi πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 153 KB

method can be effectively used to simulate devices that display optical bistability. ## IV. CONCLUSIONS In this paper, nonlinear bistability has been successfully simulated with the FDTD method. A recursive formulation is developed to model the saturable Kerr effect of a GaAs᎐GaAlAs MQW-like medi