ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    The optimal path-matching problem (1997)
    Springer
    Combinatorica 17 (1997), S. 315-337 
    Details
    ISSN: 1439-6912
    Keywords: 05C70 ; 05B35 ; 90C27 ; 68Q25
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we establish common generalizations of the main results on those two problems—polynomial-time solvability, min-max theorems, and totally dual integral polyhedral descriptions. New application of these results include a strongly polynomial separation algorithm for the convex hull of matchable sets of a graph, and a polynomial-time algorithm to compute the rank of a certain matrix of indeterminates.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01215915
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...