Centers to centroids in graphs
From MaRDI portal
Publication:3859785
DOI10.1002/jgt.3190020304zbMath0425.05021OpenAlexW1964609880MaRDI QIDQ3859785
Publication date: 1978
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190020304
Related Items
Unnamed Item ⋮ Worst-case incremental analysis for a class ofp-facility location problems ⋮ Two unconstrained optimization approaches for the Euclidean \(\kappa \)-centrum location problem ⋮ Plurality preference digraphs realized by trees. I: Necessary and sufficient conditions ⋮ A survey of sequences of central subgraphs ⋮ On discrete optimization with ordering ⋮ On \(k\)-sum optimization ⋮ Group centre and group median of a network ⋮ Using \(\ell^p\)-norms for fairness in combinatorial optimisation ⋮ The \(k\)-ball \(l\)-path branch weight centroid ⋮ Revisiting \(k\)-sum optimization ⋮ On the Steiner median of a tree ⋮ A kernel search heuristic for a fair facility location problem ⋮ Conditional median as a robust solution concept for uncapacitated location problems ⋮ On solving the planar \(k\)-centrum problem with Euclidean distances ⋮ Unimodal eccentricity in trees ⋮ Depth-based complexity traces of graphs ⋮ Accretion centers: A generalization of branch weight centroids ⋮ k-sum optimization problems ⋮ The median procedure in cluster analysis and social choice theory ⋮ Bridging \(k\)-sum and CVaR optimization in MILP ⋮ Averaging the \(k\) largest distances among \(n\): \(k\)-centra in Banach spaces ⋮ Plurality preference digraphs realized by trees. II: On realization numbers ⋮ The center function on trees ⋮ Axiomatic characterization of the center function. The case of non-universal axioms ⋮ Lattice valuations, medians and majorities ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ On \(\sigma\)-span and \(F\)-span of trees and full binary trees ⋮ The \(k\)-centrum multi-facility location problem ⋮ Smoothing method for minimizing the sum of therlargest functions ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ On single-source capacitated facility location with cost and fairness objectives ⋮ On the Center Sets of Some Graph Classes ⋮ Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost ⋮ The \(k\)-centrum shortest path problem ⋮ Finding an Euclidean anti-\(k\)-centrum location of a set of points ⋮ Group centre and group median of a tree ⋮ Least central subtrees, center, and centroid of a tree ⋮ An efficient algorithm for the Euclidean \(r\)-centrum location problem ⋮ The impact of the apex node on routing inside a pyramid structure ⋮ Medians in median graphs ⋮ Fair optimization and networks: a survey ⋮ Pendant-medians ⋮ Minimizing the sum of the \(k\) largest functions in linear time. ⋮ k-Eccentricity and absolute k-centrum of a probabilistic tree ⋮ Algorithmic results for ordered median problems ⋮ Axiomatic characterization of the center function. the case of universal axioms
Cites Work
