Campus Event Calendar
Event Entry
What and Who
A Combinatorial Algorithm for the Independent Path-Matching Problem
Bianca Spille
EPFL Lausanne
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Friday, 22 February 2002
13:00
60 Minutes
46.1 - MPII
024
Saarbrücken
Abstract
The independent path-matching problem is a common generalization of
the matching problem and the matroid intersection problem.
Cunningham and Geelen proved that this problem is solvable
in polynomial time via the ellipsoid method.
We present a polynomial-time combinatorial algorithm that generalizes
the known combinatorial algorithms for the matching problem and the matroid
intersection problem.
Contact
Friedrich Eisenbrand
--email hidden
passcode not visible
logged in users only