Pages that link to "Item:Q5431308"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2003 (Q5431308):
Displaying 9 items.
- Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
- Optimizing server placement in distributed systems in the presence of competition (Q635301) (← links)
- Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121) (← links)
- Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees (Q975474) (← links)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
- The median procedure for n-trees (Q1822174) (← links)
- (Q4281639) (← links)
- Computing the 2‐median on tree networks in O(n lg n) time (Q4894868) (← links)
- Finding \(k\)-secluded trees faster (Q6039423) (← links)