✦ LIBER ✦

A tradeoff between search and update time for the implicit dictionary problem

✍ Scribed by Allan Borodin; Faith E. Fich; Friedhelm Meyer Auf Der Heide; Eli Upfal; Avi Wigderson

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 698 KB
Volume: 58
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(88)90018-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tradeoff between search and update in

A tradeoff between search and update in dictionaries

✍ Jaikumar Radhakrishnan; Venkatesh Raman 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 64 KB

Borodin, Fich, Meyer auf der Heide, Upfal and Wigderson [Theoret. Comput. Sci. 58 (1998) 57-68] showed lower bounds for search time in implicit dictionaries with bounded update time. In particular, their result implies a lower bound of (n ε ) for search time in an implicit dictionary whenever the up

A branch-and-price-based large neighborh

A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows

✍ Eric Prescott-Gagnon; Guy Desaulniers; Louis-Martin Rousseau 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

## Abstract Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (VRPTW) consists of determining a set of feasible vehicle routes to deliver goods to a set of customers while minimizing, first, the number of vehicles used and, second, total distance tr

An approximate method for the nonlinear

An approximate method for the nonlinear diffusion problem with a power relation between diffusion coefficient and concentration—I. Computation of desorption times

✍ J.K. Liou; S. Bruin 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 868 KB