Pages that link to "Item:Q3875356"
From MaRDI portal
The following pages link to Thek best spanning arborescences of a network (Q3875356):
Displaying 16 items.
- Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions (Q1062913) (← links)
- Most and least uniform spanning trees (Q1087546) (← links)
- Ranking arborescences in O(Km log n) time (Q1142709) (← links)
- An approach for the Steiner problem in directed graphs (Q1179756) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- Finding the \(k\) smallest spanning trees (Q1196455) (← links)
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships (Q1339126) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- A note on \(K\) best network flows (Q1897375) (← links)
- Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
- A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
- A note on finding optimum branchings (Q3867580) (← links)
- The Kth TSP is pseudopolynomial when TSP is polynomial (Q4554540) (← links)
- Finding the k smallest spanning trees (Q5056090) (← links)
- Contrasting the Spread of Misinformation in Online Social Networks (Q5139596) (← links)
- Enumerating the \(k\) best plane spanning trees (Q5931369) (← links)
