Bérczi, Kristóf and Király, Tamás and Kobayashi, Yusuke (2015) Algorithmic aspects of covering supermodular functions under matroid constraints. In: 9th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, 2-5 June 2015, Fukuoka, Japán.
|
Text
egres-15-05.pdf - Accepted Version Download (345kB) | Preview |
Abstract
A common generalization of earlier results on arborescence packing and the covering of intersecting bi-set families was presented by the authors in [Bérczi, Király, Kobayashi, 2013]. The present paper investigates the algorithmic aspects of that result and gives a polynomial-time algorithm for the corresponding optimization problem.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Depositing User: | Tamás Király |
| Date Deposited: | 25 Sep 2015 17:22 |
| Last Modified: | 04 Apr 2023 11:11 |
| URI: | http://real.mtak.hu/id/eprint/28198 |
Actions (login required)
 |
Edit Item |
