The following pages link to (Q4037428):
Displaying 7 items.
- Matroid and knapsack center problems (Q300451) (← links)
- (Q5111728) (← links)
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← links)
- The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy (Q5138372) (← links)
- The backup 2‐center and backup 2‐median problems on trees (Q5191127) (← links)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)
- Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane (Q6162513) (← links)
