Pages that link to "Item:Q4443626"
From MaRDI portal
The following pages link to Spanning Trees and Optimization Problems (Q4443626):
Displayed 17 items.
- A tight bound on the min-ratio edge-partitioning problem of a tree (Q608252) (← links)
- Average distance in weighted graphs (Q658013) (← links)
- Evolutionary design of oriented-tree networks using Cayley-type encodings (Q730939) (← links)
- On the intercluster distance of a tree metric (Q861256) (← links)
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence (Q955012) (← links)
- The 2-radius and 2-radiian problems on trees (Q955029) (← links)
- Minimum congestion spanning trees in planar graphs (Q966018) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Approximating the maximum internal spanning tree problem (Q1034535) (← links)
- Opportune moment strategies for a cost spanning tree game (Q1044215) (← links)
- The minimum cost shortest-path tree game (Q1761744) (← links)
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two (Q1949099) (← links)
- On the uniform edge-partition of a tree (Q2370420) (← links)
- The swap edges of a multiple-sources routing tree (Q2479532) (← links)
- Counting spanning trees in self-similar networks by evaluating determinants (Q2851758) (← links)
- On the Clustered Steiner Tree Problem (Q2867108) (← links)
- The backup 2‐center and backup 2‐median problems on trees (Q5191127) (← links)