✦ LIBER ✦

Algorithms for finding P-centers on a weighted tree (for relatively small P)

✍ Scribed by M. Jeger; O. Kariv

Publisher: John Wiley and Sons
Year: 1985
Tongue: English
Weight: 498 KB
Volume: 15
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230150308

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear algorithm for finding the k-bro

A linear algorithm for finding the k-broadcast center of a tree

✍ Hovhannes A. Harutyunyan; Arthur L. Liestman; Bin Shao 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

An improved algorithm for the distance c

An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks

✍ Arie Tamir 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 1 views

Iteratively Weighted Approximation Algor

Iteratively Weighted Approximation Algorithms For Nonlinear Problems Using Radial Basis Function Examples

✍ D. P. Jenkinson; J. C. Mason; A. Crampton 📂 Article 📅 2004 🏛 John Wiley and Sons ⚖ 240 KB 👁 1 views

A polynomial algorithm for thep-centdian

A polynomial algorithm for thep-centdian problem on a tree

✍ Tamir, Arie; P�rez-Brito, Dionisio; Moreno-P�rez, Jos� A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 2 views

The most common problems studied in network location theory are the p-median and the p-center models. The p-median problem on a network is concerned with the location of p points (medians) on the network, such that the total (weighted) distance of all the nodes to their respective nearest points is

A p-adaptive algorithm for the BEM with

A p-adaptive algorithm for the BEM with the hypersingular operator on the plane screen

✍ Norbert Heuer; Mario E. Mellado; Ernst P. Stephan 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

## Abstract We propose a __p__‐adaptive algorithm for the Galerkin method solving the hypersingular integral operator of the Laplacian on the plane screen. The error indicators/estimators are based on projections of the actual error onto local subspaces. These subspaces are defined by decomposition

Comments on “A new theoretical and algor

Comments on “A new theoretical and algorithmical basis for estimation, identification and control” by P. Kovanic

✍ R.H. Baran 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 362 KB

Ab~ract--Kovanic's gnostical distribution (density) function is illustrated as a nonparametric estimator in numerical trials with small samples. An asymptotic evaluation suggests its consistency in the case of observations distributed according to the logistic law.