Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An algorithm for weighted fractional matroid matching   Let M be a matroid on ground set E. A subset l of E is called a `line' when
its rank equals 1 or 2. Given a set L of lines, a `fractional matching' in
(M,L) is a nonnegative vector x indexed by the lines in L, that satisfies a
system of linear constraints, one for each flat of M. Fractional matchings were
introduced by Vande Vate, who showed that the set of fractional matchings is a
half-integer relaxation of the matroid matching polytope.
  It was shown by Chang et al. that a maximum size fractional matching can be
found in polynomial time. In this paper we give a polynomial time algorithm to
find for any given weights on the lines in L, a maximum weight fractional
matching.

14
The categories of this paper are: math-ph
3
The categories of this paper are: physics
33
The categories of this paper are: plasm-ph
12
The categories of this paper are: nucl-th
4
The categories of this paper are: cond-mat
15
The categories of this paper are: nucl-ex
17
The categories of this paper are: q-fin
6
The categories of this paper are: astro-ph
10
The categories of this paper are: q-bio
24
The categories of this paper are: dg-ga
0
The categories of this paper are: hep-ph
13
The categories of this paper are: quant-ph
31
The categories of this paper are: ao-sci
11
The categories of this paper are: hep-lat
25
The categories of this paper are: patt-sol
22
The categories of this paper are: chao-dyn