Inverse eccentric vertex problem on networks

Kien Nguyen () and André Chassein ()

Central European Journal of Operations Research, 2015, vol. 23, issue 3, 687-698

Abstract: This paper addresses the problem of optimally modifying the edge lengths such that a prespecified vertex becomes the furthest vertex from a given fixed vertex in the perturbed network. We call this problem the inverse eccentric vertex problem. We show that the problem is $$NP$$ N P -complete even on cactus graphs. However, if the underlying graph is a cycle or a tree, we develop efficient algorithms with linear time complexity. Copyright Springer-Verlag Berlin Heidelberg 2015

Keywords: Eccentric vertex; Inverse optimization problem; Tree; Cycle; Cactus (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10100-014-0367-2 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:cejnor:v:23:y:2015:i:3:p:687-698

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10100

DOI: 10.1007/s10100-014-0367-2

Access Statistics for this article

Central European Journal of Operations Research is currently edited by Ulrike Leopold-Wildburger

More articles in Central European Journal of Operations Research from Springer, Slovak Society for Operations Research, Hungarian Operational Research Society, Czech Society for Operations Research, Österr. Gesellschaft für Operations Research (ÖGOR), Slovenian Society Informatika - Section for Operational Research, Croatian Operational Research Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().