Combinatorial optimization: networks and matroids 论文
2021引用 3374
graph theory and CDMA systemsGraph Labeling and Dimension ProblemsBusiness Strategy and Innovation
详细信息
- 发表日期
- 2021-08-16
- 发表年份
- 2021
关键词
graph theory and CDMA systemsGraph Labeling and Dimension ProblemsBusiness Strategy and Innovation
摘要
Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.