Inverse eccentric vertex problem on trees

MaRDI QIDQ5148364zbMATH OpenFDO

Authors Javad Tayyebi, Massoud Aman

Publication date 3 February 2021

Full work available at URL http://www.yokohamapublishers.jp/online-p/PJO/vol14/pjov14n2p245.pdf

zbMATH Keywords

eccentricityHamming distanceinverse problemstrongly NP-completeness

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Inverse eccentric vertex problem on networks
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• Optimal algorithms for inverse eccentric vertex location problem on extended star networks
• Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
• The inverse \(p\)-maxian problem on trees with variable edge lengths

Cited in

(4)

• The cardinality constrained inverse center location problems on tree networks with edge length augmentation
• Inverse eccentric vertex problem on networks
• Optimal algorithms for inverse eccentric vertex location problem on extended star networks
• Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks

This page was built for publication: Inverse eccentric vertex problem on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148364)