Pages that link to "Item:Q1607050"
From MaRDI portal
The following pages link to An algorithm for finding a \(k\)-median in a directed tree (Q1607050):
Displaying 7 items.
- On the linear relaxation of the \(p\)-median problem (Q429694) (← links)
- Comparison and analysis of ten static heuristics-based Internet data replication techniques (Q436652) (← links)
- Optimizing server placement in distributed systems in the presence of competition (Q635301) (← links)
- On the \(p\)-median polytope of \(Y\)-free graphs (Q951093) (← links)
- Joint object placement and node dimensioning for internet content distribution (Q1029097) (← links)
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs (Q1751184) (← links)
- On the Location and p-Median Polytopes (Q2971602) (← links)