New Results on the Complexity of p-Centre Problems
From MaRDI portal
Publication:3670556
DOI10.1137/0212051zbMath0521.68037OpenAlexW2032624334MaRDI QIDQ3670556
Publication date: 1983
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0212051
parallel computationlocationtree partitioningcontinuous p-center problem on a treeparametric combinatorial optimizationweighted discrete p-center problem
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions, Continuous Facility Location on Graphs, Efficient algorithms for center problems in cactus networks, A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, Computing the Center of Uncertain Points on Tree Networks, A finite algorithm for the continuousp-center location problem on a graph, Network search games, with arbitrary searcher starting point, Double bound method for solving the \(p\)-center location problem, On alternativep-center problems, New approaches to the robust 1-center location problems on tree networks, Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows, The Coverage Problem by Aligned Disks, The \(p\)-center problem under locational uncertainty of demand points, Improved algorithms for several network location problems with equality measures., The coverage problem by aligned disks, Backup 2-center on interval graphs, OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM, Complexity of fuzzy answer set programming under Łukasiewicz semantics, Locating Facilities on a Network to Minimize Their Average Service Radius, Network search games with immobile hider, without a designated searcher starting point, Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks, One-dimensional \(k\)-center on uncertain data, Efficient algorithms for the one-dimensional \(k\)-center problem, Algorithms for uniform centered partitions of trees, Uniform and most uniform partitions of trees, Computing the center of uncertain points on tree networks, The \(k\)-centrum multi-facility location problem, Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches, The backup 2‐center and backup 2‐median problems on trees, Throttling for the game of cops and robbers on graphs, Dispersing obnoxious facilities on a graph, A note on computing the center of uncertain data on the real line, A linear-time algorithm for radius-optimally augmenting paths in a metric space, Center location problems on tree graphs with subtree-shaped customers, Unnamed Item, Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances, Efficient parallel algorithms for r-dominating set and p-center problems on trees, Extending NC and RNC algorithms, Covering uncertain points in a tree, Scheduling with gaps: new models and algorithms, Dispersing Obnoxious Facilities on a Graph, Improved complexity results for several multifacility location problems on trees, Continuous bottleneck tree partitioning problems, The weighted \(k\)-center problem in trees for fixed \(k\), One-way and round-trip center location problems, An O(n log n)-Time Algorithm for the k-Center Problem in Trees, Discrete Center Problems, An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees, Locating two obnoxious facilities using the weighted maximin criterion, OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS, Locating service centers with precedence constraints, The centdian subtree on tree networks, Center problems with pos/neg weights on trees, Continuous facility location on graphs
