𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The analysis of a fringe heuristic for binary search trees

✍ Scribed by Patricio V Poblete; J.Ian Munro

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
569 KB
Volume
6
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A tabu search heuristic for the Steiner
A tabu search heuristic for the Steiner Tree Problem
✍ Gendreau, Michel; Larochelle, Jean-Francois; SansοΏ½, Brunilde πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 342 KB πŸ‘ 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se

Analysis of a Local Search Heuristic for
Analysis of a Local Search Heuristic for Facility Location Problems
✍ Madhukar R. Korupolu; C.Greg Plaxton; Rajmohan Rajaraman πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 258 KB

In this paper, we study approximation algorithms for several NP-hard facility location problems.We prove that a simple local search heuristic yields polynomialtime constant-factor approximation bounds for the metric versions of the uncapacitated k-median problem and the uncapacitated facility locati