scientific article; zbMATH DE number 177557

zbMATH Open0764.68069MaRDI QIDQ4037428FDOQ4037428

Authors: Greg N. Frederickson 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• The \(p\)-center problem in tree networks revisited
• Algorithms for finding P-centers on a weighted tree (for relatively small P)
• scientific article; zbMATH DE number 4051021
• An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
• An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees

zbMATH Keywords

linear-time algorithmsparametric search\(p\)-center problem

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25)

Cited In (43)

• A linear-time algorithm for the center problem in weighted cycle graphs
• The backup 2‐center and backup 2‐median problems on trees
• Dynamic and static algorithms for optimal placement of resources in a tree
• Backup 2-center on interval graphs
• Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches
• Optimizing squares covering a set of points
• The connected \(p\)-center problem on cactus graphs
• Efficient algorithms for the one-dimensional \(k\)-center problem
• Covering uncertain points in a tree
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
• An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths
• Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane
• The connected \(p\)-center problem on cactus graphs
• Computing the center of uncertain points on tree networks
• Continuous bottleneck tree partitioning problems
• Matroid and knapsack center problems
• Algorithms for covering multiple barriers
• Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows
• Parameterized approximation algorithms for some location problems in graphs
• Kinetic Maintenance of Mobile k-Centres on Trees
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
• Computing \(k\)-centers of uncertain points on a real line
• Kinetic maintenance of mobile \(k\)-centres on trees
• A note on computing the center of uncertain data on the real line
• An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
• The connected \(p\)-center problem on block graphs with forbidden vertices
• Efficient algorithms for center problems in cactus networks
• Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
• The 2-radius and 2-radiian problems on trees
• Scheduling with gaps: new models and algorithms
• Title not available (Why is that?)
• The multi-service center problem
• Optimal algorithms for the path/tree-shaped facility location problems in trees
• The two-center problem of uncertain points on a real line
• One-dimensional \(k\)-center on uncertain data
• Dispersion on trees
• An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
• The weighted \(k\)-center problem in trees for fixed \(k\)
• An optimal algorithm for the weighted backup 2-center problem on a tree
• Efficient algorithms for centers and medians in interval and circular-arc graphs
• Computing the center of uncertain points on tree networks

This page was built for publication:

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