scientific article
From MaRDI portal
Publication:4037428
zbMATH Open0764.68069MaRDI QIDQ4037428FDOQ4037428
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Cited In (42)
- 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
- Continuous bottleneck tree partitioning problems
- Matroid and knapsack center problems
- An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees
- 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
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees
- Title not available (Why is that?)
- 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
- The connected \(p\)-center problem on block graphs with forbidden vertices
- Efficient algorithms for center problems in cactus networks
- The Connected p-Center Problem on Cactus Graphs
- 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
- 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
- The weighted \(k\)-center problem in trees for fixed \(k\)
- An optimal algorithm for the weighted backup 2-center problem on a tree
- Computing the Center of Uncertain Points on Tree Networks
- 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)