2 papers
math.CO2011
Generalizations and Variants of the Largest Non-crossing Matching Problem in Random Bipartite Graphs
Marcos Kiwi, José A. Soto
We are interested in the statistics of the length of the longest increasing subsequence of 2-rowed lexicographically sorted arrays chosen according to distinct families of distribu…
cs.DS2011
A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids
José A. Soto
We give a simple polynomial time approximation scheme for the weighted matroid matching problem on strongly base orderable matroids. We also show that even the unweighted version o…