Algorithms – ESA 2005

DOI10.1007/11561071zbMath1162.90539OpenAlexW2501059503MaRDI QIDQ5475839

Robert Benkoczi, Binay K. Bhattacharya

Publication date: 27 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11561071

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (12)

The connected \(p\)-median problem on block graphs ⋮ Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights ⋮ Efficient algorithms for finding <scp>2‐medians</scp> of a tree ⋮ Optimizing server placement in distributed systems in the presence of competition ⋮ Classical and inverse median location problems under uncertain environment ⋮ The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers ⋮ Inverse \(p\)-median problems with variable edge lengths ⋮ The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers ⋮ Efficient computation of 2-medians in a tree network with positive/negative weights ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees ⋮ A SOLUTION ALGORITHM FOR p-MEDIAN LOCATION PROBLEM ON UNCERTAIN RANDOM NETWORKS ⋮ A HYBRID ALGORITHM FOR THE UNCERTAIN INVERSE p-MEDIAN LOCATION PROBLEM

This page was built for publication: Algorithms – ESA 2005