The following pages link to Optimum branchings (Q5537097):
Displaying 50 items.
- A multiperiod min-sum arborescence problem (Q260662) (← links)
- Inferring contagion patterns in social contact networks with limited infection data (Q264272) (← links)
- Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers (Q280459) (← links)
- Compression of finite-state automata through failure transitions (Q300258) (← links)
- Approximations for constructing tree-form structures using specific material with fixed length (Q315511) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- On finding optimal polytrees (Q500966) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- An efficient scaling algorithm for the minimum weight bibranching problem (Q652532) (← links)
- Minimum cost arborescences (Q665084) (← links)
- Axiomatization of the Shapley value on minimum cost spanning tree games (Q700116) (← links)
- Cross-monotonic cost sharing methods for connected facility location games (Q703566) (← links)
- Exact solution approaches for the multi-period degree constrained minimum spanning tree problem (Q724056) (← links)
- On the core of network synthesis games (Q757264) (← links)
- Distributed block-diagonal approximation methods for regularized empirical risk minimization (Q782443) (← links)
- Beyond Moulin mechanisms (Q834858) (← links)
- Fair cost-sharing methods for the minimum spanning tree game (Q845820) (← links)
- Generalized risk-dominance and asymmetric dynamics (Q848615) (← links)
- Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
- A branch and bound algorithm for the minimax regret spanning arborescence (Q878227) (← links)
- Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
- Learning extended tree augmented naive structures (Q895526) (← links)
- Approximation algorithms for restricted Bayesian network structures (Q975400) (← links)
- Approximating optimum branchings in linear time (Q976065) (← links)
- Eisenberg-Gale markets: algorithms and game-theoretic properties (Q993788) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← 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)
- Exact arborescences, matchings and cycles (Q1095157) (← links)
- Weighting factor extensions for finite multiple objective vector minimization problems (Q1106737) (← links)
- Characterizations of adjacency on the branching polyhedron (Q1139604) (← links)
- On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem (Q1146193) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Facets of two Steiner arborescence polyhedra (Q1181904) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- Structural properties of matroid matchings (Q1199466) (← links)
- Improved processor bounds for parallel algorithms for weighted directed graphs (Q1209343) (← links)
- An unbounded matroid intersection polyhedron (Q1244236) (← links)
- Local unimodularity of matrix-vector pairs (Q1253183) (← links)
- An efficient algorithm for minimum-weight bibranching (Q1272485) (← links)
- Multicommodity flow models for spanning trees with hop constraints (Q1278374) (← links)
- Minimum directed 1-subtree relaxation for score orienteering problem (Q1291640) (← links)
- Directed Steiner problems with connectivity constraints (Q1315992) (← links)
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships (Q1339126) (← links)
- A strongly polynomial algorithm for the inverse shortest arborescence problem (Q1383373) (← links)
- Arborescence optimization problems solvable by Edmonds' algorithm (Q1399999) (← links)
- Recent results on approximating the Steiner tree problem and its generalizations (Q1566960) (← links)
