Pages that link to "Item:Q3964299"
From MaRDI portal
The following pages link to Worst-Case Analysis of Network Design Problem Heuristics (Q3964299):
Displaying 20 items.
- Models and algorithms for network reduction (Q320811) (← links)
- A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (Q342561) (← links)
- Finding best swap edges minimizing the routing cost of a spanning tree (Q476426) (← links)
- Spanning trees: A survey (Q659663) (← links)
- On the intercluster distance of a tree metric (Q861256) (← links)
- On the minimum average distance spanning tree of the hypercube (Q934836) (← links)
- Efficient methods for multiple sequence alignment with guaranteed error bounds (Q1203038) (← links)
- Approximation algorithms for some optimum communication spanning tree problems (Q1566575) (← links)
- Approximation algorithms for the shortest total path length spanning tree problem (Q1582085) (← links)
- Low complexity variants of the arrow distributed directory (Q1604202) (← links)
- Approximation algorithms for the optimal \(p\)-source communication spanning tree (Q1887037) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm (Q2317621) (← links)
- On the minimum routing cost clustered tree problem (Q2359809) (← links)
- Distance preserving subtrees in minimum average distance spanning trees (Q2864852) (← links)
- Light graphs with small routing cost (Q4537619) (← links)
- Exact algorithms for minimum routing cost trees (Q4537623) (← links)
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité (Q5479860) (← links)
- Compact location problems with budget and communication constraints (Q6064048) (← links)
- NeuroPrim: an attention-based model for solving NP-hard spanning tree problems (Q6564769) (← links)
