scientific article
From MaRDI portal
Publication:4037428
zbMath0764.68069MaRDI QIDQ4037428
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (41)
Efficient algorithms for center problems in cactus networks ⋮ The connected \(p\)-center problem on cactus graphs ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ Efficient algorithms for centers and medians in interval and circular-arc graphs ⋮ Matroid and knapsack center problems ⋮ Computing the Center of Uncertain Points on Tree Networks ⋮ Computing \(k\)-centers of uncertain points on a real line ⋮ An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths ⋮ The algorithmic use of hypertree structure and maximum neighbourhood orderings ⋮ The multi-service center problem ⋮ Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows ⋮ The Connected p-Center Problem on Cactus Graphs ⋮ The connected \(p\)-center problem on block graphs with forbidden vertices ⋮ Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane ⋮ The two-center problem of uncertain points on a real line ⋮ Backup 2-center on interval graphs ⋮ The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy ⋮ Kinetic Maintenance of Mobile k-Centres on Trees ⋮ Dynamic and static algorithms for optimal placement of resources in a tree ⋮ One-dimensional \(k\)-center on uncertain data ⋮ Efficient algorithms for the one-dimensional \(k\)-center problem ⋮ An optimal algorithm for the weighted backup 2-center problem on a tree ⋮ Optimizing squares covering a set of points ⋮ The 2-radius and 2-radiian problems on trees ⋮ Computing the center of uncertain points on tree networks ⋮ The algorithmic use of hypertree structure and maximum neighbourhood orderings ⋮ 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 ⋮ Parameterized approximation algorithms for some location problems in graphs ⋮ Algorithms for covering multiple barriers ⋮ A note on computing the center of uncertain data on the real line ⋮ Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs ⋮ Unnamed Item ⋮ Covering uncertain points in a tree ⋮ Scheduling with gaps: new models and algorithms ⋮ Kinetic maintenance of mobile \(k\)-centres on trees ⋮ Optimal algorithms for the path/tree-shaped facility location problems in trees ⋮ Continuous bottleneck tree partitioning problems ⋮ The weighted \(k\)-center problem in trees for fixed \(k\) ⋮ 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
This page was built for publication:
