Exact and approximation algorithms for weighted matroid intersection

Chien Chung Huang, Naonori Kakimura, Naoyuki Kamiyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In this paper, we propose new exact and approximation algorithms for the weighted matroid intersection problem. Our exact algorithm is faster than previous algorithms when the largest weight is relatively small. Our approximation algorithm delivers a (1 - ϵ)-approximate solution with a running time significantly faster than known exact algorithms. The core of our algorithms is a decomposition technique: we decompose an instance of the weighted matroid intersection problem into a set of instances of the unweighted matroid intersection problem. The computational advantage of this approach is that we can make use of fast unweighted matroid intersection algorithms as a black box for designing algorithms. Precisely speaking, we prove that we can solve the weighted matroid intersection problem via solving W instances of the unweighted matroid intersection problem, where W is the largest given weight. Furthermore, we can find a (1 - ϵ)-approximate solution via solving O(ϵ-1 log r) instances of the unweighted matroid intersection problem, where r is the smallest rank of the given two matroids. Our algorithms are simple and flexible: they can be adapted to special cases of the weighted matroid intersection problem, using specialized unweighted matroid intersection algorithms. In this paper, we will show the following results. 1. Given two general matroids, using Cunningham's algorithm, we can solve the weighted matroid intersection problem exactly in O(τWnr1.5) time and (1 - ϵ)-approximately in O(τϵ-1nr1.5 logr) time, where n is the size of the ground set and r is the time complexity of an independence oracle call. 2. Given two graphic matroids, using the algorithm of Gabow and Xu, we can solve the weighted matroid intersection problem exactly in O(W√rn log r) time and (1 - ϵ)-approximately in O(ϵ-1 √rn log2r) time. 3. Given two linear matroids (in the form of two r-by-n matrices), using the algorithm of Cheung, Kwok, and Lau, we can solve the weighted matroid intersection problem exactly in O(nr log r∗ + Wnrω∗-1) time and (1 - ϵ)-approximately in O(nr logr∗ + ϵ-1nrω∗-1 logr∗) time, where ω is the exponent of the matrix multiplication time and r∗ is the maximum size of a common independent set. Finally, we give a further application of our decomposition technique. We use our technique to solve efficiently the rankmaximal matroid intersection problem, a problem motivated by matching problems under preferences.

Original languageEnglish
Title of host publication27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016
PublisherAssociation for Computing Machinery
Pages430-444
Number of pages15
Volume1
ISBN (Electronic)9781510819672
Publication statusPublished - 2016
Externally publishedYes
Event27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016 - Arlington, United States
Duration: 2016 Jan 102016 Jan 12

Other

Other27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016
CountryUnited States
CityArlington
Period16/1/1016/1/12

Fingerprint

Matroid Intersection
Approximation algorithms
Exact Algorithms
Approximation Algorithms
Matroid
Decomposition Techniques
Approximate Solution
Matrix multiplication
Matching Problem
Independent Set
Black Box

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Cite this

Huang, C. C., Kakimura, N., & Kamiyama, N. (2016). Exact and approximation algorithms for weighted matroid intersection. In 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016 (Vol. 1, pp. 430-444). Association for Computing Machinery.

Exact and approximation algorithms for weighted matroid intersection. / Huang, Chien Chung; Kakimura, Naonori; Kamiyama, Naoyuki.

27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Vol. 1 Association for Computing Machinery, 2016. p. 430-444.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Huang, CC, Kakimura, N & Kamiyama, N 2016, Exact and approximation algorithms for weighted matroid intersection. in 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. vol. 1, Association for Computing Machinery, pp. 430-444, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, United States, 16/1/10.
Huang CC, Kakimura N, Kamiyama N. Exact and approximation algorithms for weighted matroid intersection. In 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Vol. 1. Association for Computing Machinery. 2016. p. 430-444
Huang, Chien Chung ; Kakimura, Naonori ; Kamiyama, Naoyuki. / Exact and approximation algorithms for weighted matroid intersection. 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Vol. 1 Association for Computing Machinery, 2016. pp. 430-444
@inproceedings{768a02982d464acc83bebd1dd5c3f705,
title = "Exact and approximation algorithms for weighted matroid intersection",
abstract = "In this paper, we propose new exact and approximation algorithms for the weighted matroid intersection problem. Our exact algorithm is faster than previous algorithms when the largest weight is relatively small. Our approximation algorithm delivers a (1 - ϵ)-approximate solution with a running time significantly faster than known exact algorithms. The core of our algorithms is a decomposition technique: we decompose an instance of the weighted matroid intersection problem into a set of instances of the unweighted matroid intersection problem. The computational advantage of this approach is that we can make use of fast unweighted matroid intersection algorithms as a black box for designing algorithms. Precisely speaking, we prove that we can solve the weighted matroid intersection problem via solving W instances of the unweighted matroid intersection problem, where W is the largest given weight. Furthermore, we can find a (1 - ϵ)-approximate solution via solving O(ϵ-1 log r) instances of the unweighted matroid intersection problem, where r is the smallest rank of the given two matroids. Our algorithms are simple and flexible: they can be adapted to special cases of the weighted matroid intersection problem, using specialized unweighted matroid intersection algorithms. In this paper, we will show the following results. 1. Given two general matroids, using Cunningham's algorithm, we can solve the weighted matroid intersection problem exactly in O(τWnr1.5) time and (1 - ϵ)-approximately in O(τϵ-1nr1.5 logr) time, where n is the size of the ground set and r is the time complexity of an independence oracle call. 2. Given two graphic matroids, using the algorithm of Gabow and Xu, we can solve the weighted matroid intersection problem exactly in O(W√rn log r) time and (1 - ϵ)-approximately in O(ϵ-1 √rn log2r) time. 3. Given two linear matroids (in the form of two r-by-n matrices), using the algorithm of Cheung, Kwok, and Lau, we can solve the weighted matroid intersection problem exactly in O(nr log r∗ + Wnrω∗-1) time and (1 - ϵ)-approximately in O(nr logr∗ + ϵ-1nrω∗-1 logr∗) time, where ω is the exponent of the matrix multiplication time and r∗ is the maximum size of a common independent set. Finally, we give a further application of our decomposition technique. We use our technique to solve efficiently the rankmaximal matroid intersection problem, a problem motivated by matching problems under preferences.",
author = "Huang, {Chien Chung} and Naonori Kakimura and Naoyuki Kamiyama",
year = "2016",
language = "English",
volume = "1",
pages = "430--444",
booktitle = "27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Exact and approximation algorithms for weighted matroid intersection

AU - Huang, Chien Chung

AU - Kakimura, Naonori

AU - Kamiyama, Naoyuki

PY - 2016

Y1 - 2016

N2 - In this paper, we propose new exact and approximation algorithms for the weighted matroid intersection problem. Our exact algorithm is faster than previous algorithms when the largest weight is relatively small. Our approximation algorithm delivers a (1 - ϵ)-approximate solution with a running time significantly faster than known exact algorithms. The core of our algorithms is a decomposition technique: we decompose an instance of the weighted matroid intersection problem into a set of instances of the unweighted matroid intersection problem. The computational advantage of this approach is that we can make use of fast unweighted matroid intersection algorithms as a black box for designing algorithms. Precisely speaking, we prove that we can solve the weighted matroid intersection problem via solving W instances of the unweighted matroid intersection problem, where W is the largest given weight. Furthermore, we can find a (1 - ϵ)-approximate solution via solving O(ϵ-1 log r) instances of the unweighted matroid intersection problem, where r is the smallest rank of the given two matroids. Our algorithms are simple and flexible: they can be adapted to special cases of the weighted matroid intersection problem, using specialized unweighted matroid intersection algorithms. In this paper, we will show the following results. 1. Given two general matroids, using Cunningham's algorithm, we can solve the weighted matroid intersection problem exactly in O(τWnr1.5) time and (1 - ϵ)-approximately in O(τϵ-1nr1.5 logr) time, where n is the size of the ground set and r is the time complexity of an independence oracle call. 2. Given two graphic matroids, using the algorithm of Gabow and Xu, we can solve the weighted matroid intersection problem exactly in O(W√rn log r) time and (1 - ϵ)-approximately in O(ϵ-1 √rn log2r) time. 3. Given two linear matroids (in the form of two r-by-n matrices), using the algorithm of Cheung, Kwok, and Lau, we can solve the weighted matroid intersection problem exactly in O(nr log r∗ + Wnrω∗-1) time and (1 - ϵ)-approximately in O(nr logr∗ + ϵ-1nrω∗-1 logr∗) time, where ω is the exponent of the matrix multiplication time and r∗ is the maximum size of a common independent set. Finally, we give a further application of our decomposition technique. We use our technique to solve efficiently the rankmaximal matroid intersection problem, a problem motivated by matching problems under preferences.

AB - In this paper, we propose new exact and approximation algorithms for the weighted matroid intersection problem. Our exact algorithm is faster than previous algorithms when the largest weight is relatively small. Our approximation algorithm delivers a (1 - ϵ)-approximate solution with a running time significantly faster than known exact algorithms. The core of our algorithms is a decomposition technique: we decompose an instance of the weighted matroid intersection problem into a set of instances of the unweighted matroid intersection problem. The computational advantage of this approach is that we can make use of fast unweighted matroid intersection algorithms as a black box for designing algorithms. Precisely speaking, we prove that we can solve the weighted matroid intersection problem via solving W instances of the unweighted matroid intersection problem, where W is the largest given weight. Furthermore, we can find a (1 - ϵ)-approximate solution via solving O(ϵ-1 log r) instances of the unweighted matroid intersection problem, where r is the smallest rank of the given two matroids. Our algorithms are simple and flexible: they can be adapted to special cases of the weighted matroid intersection problem, using specialized unweighted matroid intersection algorithms. In this paper, we will show the following results. 1. Given two general matroids, using Cunningham's algorithm, we can solve the weighted matroid intersection problem exactly in O(τWnr1.5) time and (1 - ϵ)-approximately in O(τϵ-1nr1.5 logr) time, where n is the size of the ground set and r is the time complexity of an independence oracle call. 2. Given two graphic matroids, using the algorithm of Gabow and Xu, we can solve the weighted matroid intersection problem exactly in O(W√rn log r) time and (1 - ϵ)-approximately in O(ϵ-1 √rn log2r) time. 3. Given two linear matroids (in the form of two r-by-n matrices), using the algorithm of Cheung, Kwok, and Lau, we can solve the weighted matroid intersection problem exactly in O(nr log r∗ + Wnrω∗-1) time and (1 - ϵ)-approximately in O(nr logr∗ + ϵ-1nrω∗-1 logr∗) time, where ω is the exponent of the matrix multiplication time and r∗ is the maximum size of a common independent set. Finally, we give a further application of our decomposition technique. We use our technique to solve efficiently the rankmaximal matroid intersection problem, a problem motivated by matching problems under preferences.

UR - http://www.scopus.com/inward/record.url?scp=84962800110&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84962800110&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84962800110

VL - 1

SP - 430

EP - 444

BT - 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016

PB - Association for Computing Machinery

ER -