Skip to main content
Journal Article

A stochastic location problem with applications to tele-diagnostic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3353 201-213
DOI: 10.1007/978-3-540-30559-0_17
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we study a stochastic location problem with applications to tele-diagnostic, locating the boundaries between polynomiality and NP-completeness, and providing efficient approximation algorithms. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Apollonio, N., Caramia, M., & Italiano, G. F. (2004). A stochastic location problem with applications to tele-diagnostic. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3353, 201–213. https://doi.org/10.1007/978-3-540-30559-0_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free