A linear-time approximation algorithm for weighted matchings in graphs

Vinkemeier, D.E.D. ORCID: 0000-0001-8767-4355 and Hougardy, S., 2005. A linear-time approximation algorithm for weighted matchings in graphs. ACM Transactions on Algorithms, 1 (1), pp. 107-122. ISSN 1549-6325

Full text not available from this repository.
Item Type: Journal article
Publication Title: ACM Transactions on Algorithms
Creators: Vinkemeier, D.E.D. and Hougardy, S.
Publisher: Association for Computing Machinery (ACM)
Date: July 2005
Volume: 1
Number: 1
ISSN: 1549-6325
Identifiers:
NumberType
10.1145/1077464.1077472DOI
1849497Other
Divisions: Schools > School of Science and Technology
Record created by: Jeremy Silvester
Date Added: 04 Jan 2024 11:04
Last Modified: 04 Jan 2024 11:04
URI: https://irep.ntu.ac.uk/id/eprint/50619

Actions (login required)

Edit View Edit View

Views

Views per month over past year

Downloads

Downloads per month over past year