A weighted independent even factor algorithm
スポンサーリンク
概要
- 論文の詳細を見る
An even factor in a digraph is a vertex-disjoint collection of directed cycles of even length and directed paths. An even factor is called independent if it satisfies a certain matroid constraint. The problem of finding an independent even factor of maximum size is a common generalization of the nonbipartite matching and matroid intersection problems. In this paper, we present a primal-dual algorithm for the weighted independent even factor problem in odd-cycle-symmetric weighted digraphs. Cunningham and Geelen have shown that this problem is solvable via valuated matroid intersection. Their method yields a combinatorial algorithm running in O(n [3] γ + n [6] m) time, where n and m are the number of vertices and edges, respectively, and γ is the time for an independence test. In contrast, combining the weighted even factor and independent even factor algorithms, our algorithm works more directly and runs in O(n [4] γ + n [5]) time. The algorithm is fully combinatorial, and thus provides a new dual integrality theorem which commonly extends the total dual integrality theorems for matching and matroid intersection.
論文 | ランダム
- 残響時間制御システムの開発とサラウンドシステムへの適用(立体音響・音場制御/一般)
- 音響機器の振動対策による音質・音像表現の改善に関する研究
- 事例に基づく演奏表情生成システムにおける演奏類似性と試聴評価(音楽生成・表情生成 1)
- オフィスビルにおける分煙対策 (特設 最近の分煙対策の動向)
- 特設 最近の分煙対策の動向