New algorithms for linear k -matroid intersection and matroid k -parity problems
dc.contributor.author | Barvinok, Alexander I. | en_US |
dc.date.accessioned | 2006-09-11T19:33:44Z | |
dc.date.available | 2006-09-11T19:33:44Z | |
dc.date.issued | 1995-07 | en_US |
dc.identifier.citation | Barvinok, Alexander I.; (1995). "New algorithms for linear k -matroid intersection and matroid k -parity problems." Mathematical Programming 69 (1-3): 449-470. <http://hdl.handle.net/2027.42/47928> | en_US |
dc.identifier.issn | 0025-5610 | en_US |
dc.identifier.issn | 1436-4646 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/47928 | |
dc.description.abstract | We present algorithms for the k -Matroid Intersection Problem and for the Matroid k -Parity Problem when the matroids are represented over the field of rational numbers and k > 2. The computational complexity of the algorithms is linear in the cardinality and singly exponential in the rank of the matroids. As an application, we describe new polynomially solvable cases of the k -Dimensional Assignment Problem and of the k -Dimensional Matching Problem. The algorithms use some new identities in multilinear algebra including the generalized Binet—Cauchy formula and its analogue for the Pfaffian. These techniques extend known methods developed earlier for k = 2. | en_US |
dc.format.extent | 1281717 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag; The Mathematical Programming Society, Inc. | en_US |
dc.subject.other | Mathematical Methods in Physics | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Calculus of Variations and Optimal Control | en_US |
dc.subject.other | Mathematics of Computing | en_US |
dc.subject.other | Mathematical and Computational Physics | en_US |
dc.subject.other | Numerical Analysis | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Matroid K -Parity Problem | en_US |
dc.subject.other | Combinatorics | en_US |
dc.subject.other | Hyperdeterminant | en_US |
dc.subject.other | K -Matroid Intersection Problem | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.subject.other | Numerical and Computational Methods | en_US |
dc.title | New algorithms for linear k -matroid intersection and matroid k -parity problems | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, 48109-1003, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/47928/1/10107_2005_Article_BF01585571.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF01585571 | en_US |
dc.identifier.source | Mathematical Programming | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.