Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Algorithmica

Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One

Markus Bläser, Bodo Manthey

Journal Title: Algorithmica

Date: 2005

Volume: 42

Issue: 2

p. 121 - 139

For further information about this item go to:

http://dx.doi.org/10.1007/s00453-004-1131-0

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12