Finding optimum branchings
From MaRDI portal
Publication:4158841
DOI10.1002/NET.3230070103zbMATH Open0379.90100OpenAlexW1988615825MaRDI QIDQ4158841FDOQ4158841
Authors: Robert E. Tarjan 
Publication date: 1977
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230070103
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Integer programming (90C10)
Cites Work
Cited In (56)
- Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets
- Algorithm for sequential construction of spanning minimal directed forests
- Minimizing total interference in asymmetric sensor networks
- Title not available (Why is that?)
- Learning extended tree augmented naive structures
- Coordination problems on networks revisited: statics and dynamics
- A multiperiod min-sum arborescence problem
- Estimating an oncogenetic tree when false negatives and positives are present
- Arborescence optimization problems solvable by Edmonds' algorithm
- The Complexity of Synthesis of b-Bounded Petri Nets
- Approximating the Spanning k-Tree Forest Problem
- A dual ascent approach for steiner tree problems on a directed graph
- Title not available (Why is that?)
- Approximate maximum weight branchings
- The weighted arborescence constraint
- On the complexity of some arborescences finding problems on a multishop radio network
- Compression of finite-state automata through failure transitions
- New lower bounds for the symmetric travelling salesman problem
- The traveling salesman problem: An overview of exact and approximate algorithms
- Dispersal routes reconstruction and the minimum cost arborescence problem
- Minimum directed 1-subtree relaxation for score orienteering problem
- An exact algorithm for the capacitated shortest spanning arborescence
- Ranking arborescences in O(Km log n) time
- Optimum matching forests I: Special weights
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Euler is standing in line dial-a-ride problems with precedence-constraints
- On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
- On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem
- Approximating the spanning \(k\)-tree forest problem
- The Min-Max Spanning Tree Problem and some extensions
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
- Combinatorial algorithms for DNA sequence assembly
- On some multicriteria arborescence problems: Complexity and algorithms
- Minimax regret spanning arborescences under uncertain costs
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
- Polyhedral proof methods in combinatorial optimization
- How to sort by walking on a tree
- Most and least uniform spanning trees
- Use of matroid theory in operations research, circuits and systems theory
- Cycle contraction in oriented graphs
- Directed Steiner trees with diffusion costs
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- A distributed algorithm for directed minimum-weight spanning tree
- On finding optimal polytrees
- How to sort by walking and swapping on paths and trees
- Inferring (biological) signal transduction networks via transitive reductions of directed graphs
- An additive bounding procedure for the asymmetric travelling salesman problem
- Heuristic and exact algorithms for minimum-weight non-spanning arborescences
- The rectilinear Steiner arborescence problem
- Asymptotic behavior of eigenvalues and random updating schemes
- The complexity of finding arborescences in hypergraphs
- A branch-and-bound algorithm for the double travelling salesman problem with two stacks
- Greedy can beat pure dynamic programming
- Complexity of some inverse shortest path lengths problems
- Maximal dynamic polymatroid flows and applications
This page was built for publication: Finding optimum branchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4158841)
