✦ LIBER ✦

A degree sequence problem related to network design

✍ Scribed by Daniel Bienstock; Oktay Günlük

Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 917 KB
Volume: 24
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230240402

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounding techniques for the degree

Lower bounding techniques for the degree-constrained network design problem

✍ Güvenç Şahin; Ravindra K. Ahuja 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB 👁 1 views

A reliability-based network design probl

A reliability-based network design problem

✍ Piya Chootinan; S. C. Wong; Anthony Chen 📂 Article 📅 2005 🏛 Institute for Transportation Inc. 🌐 English ⚖ 1020 KB

A combinatorial problem related to distr

A combinatorial problem related to distributed loop networks

✍ D.-Z. Du; D. F. Hsu; Qiao Li; Junming Xu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 414 KB

Probabilistic analysis of a network desi

Probabilistic analysis of a network design problem heuristic

✍ Richard T. Wong 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 715 KB

A problem of combinatorial designs relat

A problem of combinatorial designs related to authentication codes

✍ Dingyi Pei 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 433 KB 👁 2 views

The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities Pr of successful deception in an optimum spoofing attack of order r for r = 0, 1, . . . , t -1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially

The complexity of the network design pro

The complexity of the network design problem

✍ D. S. Johnson; J. K. Lenstra; A. H. G. Rinnooy Kan 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 278 KB