The following pages link to Algorithms and Computation (Q5897928):
Displaying 15 items.
- Finding best swap edges minimizing the routing cost of a spanning tree (Q476426) (← links)
- A faster computation of all the best swap edges of a shortest paths tree (Q893317) (← links)
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
- Balancing of simple assembly lines under variations of task processing times (Q1945084) (← links)
- An improved algorithm for computing all the best swap edges of a tree spanner (Q1986961) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← links)
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems (Q2089667) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- Stability of Networks in Stretchable Graphs (Q3408163) (← links)
- A Faster Computation of All the Best Swap Edges of a Tree Spanner (Q3460719) (← links)
- A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners (Q5090997) (← links)
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner (Q5136230) (← links)
- A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges (Q5886043) (← links)
