Best location of service centers in a treelike network under budget constraints

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

We consider the problem of locating service centers in a treelike network in order to maximize the serviced population under budget constraints. We show that the problem is NP-hard. In the case where the costs of establishing the service centers are equal for all n cities we obtain the maximum weight k-domination problem. An O(nk2) dynamic programming procedure is given. Then an O(nB2) pseudo-polynomial dynamic programming procedure is presented for the original problem, where B is the budget constraint. Finally a variation of the new left-right dynamic programming technique is applied to obtain a more efficient pseudo-polynomial procedure.

Original languageEnglish (US)
Pages (from-to)199-214
Number of pages16
JournalDiscrete Mathematics
Volume86
Issue number1-3
DOIs
StatePublished - Dec 14 1990

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Best location of service centers in a treelike network under budget constraints'. Together they form a unique fingerprint.

Cite this