Pages that link to "Item:Q3947422"
From MaRDI portal
The following pages link to Polynomially bounded algorithms for locatingp-centers on a tree (Q3947422):
Displaying 20 items.
- One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
- Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977) (← links)
- Bee colony optimization for the \(p\)-center problem (Q632685) (← links)
- Some aspects of perfect elimination orderings in chordal graphs (Q792351) (← links)
- The discrete p-dispersion problem (Q915643) (← links)
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571) (← links)
- Analytical models for locating undesirable facilities (Q1118522) (← links)
- Locational analysis (Q1173002) (← links)
- Some aspects of the semi-perfect elimination (Q1175796) (← links)
- Efficient parallel algorithms for r-dominating set and p-center problems on trees (Q1262780) (← links)
- New linear time algorithms for generating perfect elimination orderings of chordal graphs (Q1350607) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- A note on computing the center of uncertain data on the real line (Q1790197) (← links)
- Dominant, an algorithm for the \(p\)-center problem. (Q1811146) (← links)
- The 1-center problem in the plane with independent random weights (Q2456633) (← links)
- A Class of Balanced Matrices Arising from Location Problems (Q3222208) (← links)
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← links)
- An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648) (← links)
- Dispersion problem on a convex polygon (Q6602315) (← links)
