✦ LIBER ✦

Worst Case Bounds for Maximal Compatible Subsets

✍ Scribed by Rubin, F.

Book ID: 114588362
Publisher: IEEE
Year: 1975
Tongue: English
Weight: 339 KB
Volume: C-24
Category: Article
ISSN: 0018-9340
DOI: 10.1109/t-c.1975.224315

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Worst-Case Upper Bounds for SAT

✍ Edward A. Hirsch 📂 Article 📅 2000 🏛 Springer Netherlands 🌐 English ⚖ 153 KB

Worst Case Bounds for Shortest Path Inte

Worst Case Bounds for Shortest Path Interval Routing

✍ Cyril Gavoille; Eric Guévremont 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Consider shortest path inter¨al routing, a popular memory-balanced method for Ž . solving the routing problem on arbitrary networks. Given a network G, let IRS G denote the maximum number of intervals necessary to encode groups of destinations on an edge, minimized over all shortest path interval ro

Worst case bounds for the Euclidean matc

Worst case bounds for the Euclidean matching problem

✍ David Avis 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 424 KB

R0 bounds for worst-case endemic mixing

R0 bounds for worst-case endemic mixing models

✍ Edward H. Kaplan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 98 KB

Worst-Case Bounds for the Logarithmic Lo

Worst-Case Bounds for the Logarithmic Loss of Predictors

✍ Nicolò Cesa-Bianchi; Gábor Lugosi 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 94 KB

Data dependent worst case bounds for wei

Data dependent worst case bounds for weighted set packing

✍ Roy H. Kwon 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 305 KB