Publication | Closed Access

The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance

Mathematical ProgrammingEngineeringGraph Theory1-Median ProblemAlgorithmic Information TheoryLower BoundAlgorithmic EfficiencyComputational ComplexityExtremal CombinatoricsRange SearchingDiscrete MathematicsInverse ConvexCombinatorial OptimizationApproximation TheoryHamming Distance