Shortest bibranchings and valuated matroid intersection
type: Item
instance of: scholarly article
title: Shortest bibranchings and valuated matroid intersection
zbMATH Open document ID: 1254.90199
author: Kenjiro Takazawa
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 2012-12-28T00:00:00Z
full work available at URL: http://hdl.handle.net/2433/167968
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 52B40
zbMATH DE Number: 6119224
zbMATH Keywords: shortest bibranching
zbMATH Keywords: arborescence
zbMATH Keywords: valuated matroidintersection
zbMATH Keywords: discrete convex function
MaRDI profile type: Publication
OpenAlex ID: W2005561317
cites work: Valuated matroids: A new look at the greedy algorithm
cites work: Valuated matroids
cites work: A weighted matroid intersection algorithm
cites work: Submodular functions and optimization.
cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
cites work: AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
cites work: An efficient algorithm for minimum-weight bibranching
cites work: Matroid intersection algorithms
cites work: Convexity and Steinitz's exchange property
cites work: Valuated Matroid Intersection I: Optimality Criteria
cites work: Valuated Matroid Intersection II: Algorithms
cites work: Discrete Convex Analysis
cites work: Matrices and matroids for systems analysis
cites work: \(M\)-convex function on generalized polymatroid
cites work: Min-max Relations for Directed Graphs
cites work: Total dual integrality of matching forest constraints
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: A constructive proof for the induction of M-convex functions through networks
cites work: Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints
cites work: Optimal Matching Forests and Valuated Delta-Matroids
cites work: On some techniques useful for solution of transportation network problems
DOI: 10.1007/S13160-012-0072-2
description: scientific article; zbMATH DE number 6119224