The following pages link to Finding optimum branchings (Q4158841):
Displaying 50 items.
- A multiperiod min-sum arborescence problem (Q260662) (← links)
- Compression of finite-state automata through failure transitions (Q300258) (← links)
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Asymptotic behavior of eigenvalues and random updating schemes (Q688863) (← links)
- Approximate maximum weight branchings (Q845674) (← links)
- Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
- Learning extended tree augmented naive structures (Q895526) (← links)
- Inferring (biological) signal transduction networks via transitive reductions of directed graphs (Q930591) (← links)
- Maximal dynamic polymatroid flows and applications (Q1077321) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (Q1086246) (← links)
- Most and least uniform spanning trees (Q1087546) (← links)
- On the complexity of some arborescences finding problems on a multishop radio network (Q1123615) (← links)
- Ranking arborescences in O(Km log n) time (Q1142709) (← links)
- On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem (Q1146193) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- The rectilinear Steiner arborescence problem (Q1186802) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- The complexity of finding arborescences in hypergraphs (Q1205723) (← links)
- The Min-Max Spanning Tree Problem and some extensions (Q1244239) (← links)
- Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships (Q1339126) (← links)
- Arborescence optimization problems solvable by Edmonds' algorithm (Q1399999) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Estimating an oncogenetic tree when false negatives and positives are present (Q1603295) (← links)
- Greedy can beat pure dynamic programming (Q1628699) (← links)
- New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
- Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
- An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
- On some multicriteria arborescence problems: Complexity and algorithms (Q1917271) (← links)
- The weighted arborescence constraint (Q2011589) (← links)
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences (Q2189916) (← links)
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments (Q2235733) (← links)
- How to sort by walking and swapping on paths and trees (Q2408166) (← links)
- Cycle contraction in oriented graphs (Q2513141) (← links)
- Dispersal routes reconstruction and the minimum cost arborescence problem (Q2632050) (← links)
- A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
- Complexity of some inverse shortest path lengths problems (Q3057164) (← links)
- A dual ascent approach for steiner tree problems on a directed graph (Q3315294) (← links)
- How to Sort by Walking on a Tree (Q3452827) (← links)
- Use of matroid theory in operations research, circuits and systems theory (Q3898311) (← links)
- Optimum matching forests I: Special weights (Q3922478) (← links)
- APPROXIMATING THE SPANNING k-TREE FOREST PROBLEM (Q4923297) (← links)
- (Q4969074) (← links)
- (Q5019696) (← links)
- The Complexity of Synthesis of b-Bounded Petri Nets (Q5025061) (← links)
- Approximating the Spanning k-Tree Forest Problem (Q5321721) (← links)
- A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (Q5326779) (← links)
- Coordination problems on networks revisited: statics and dynamics (Q5860332) (← links)
