scientific article; zbMATH DE number 1947046

zbMATH Open1013.90123MaRDI QIDQ4411276FDOQ4411276

Authors: Markus Bläser, Bodo Manthey 

Publication date: 7 July 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2462/24620040.htm

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1875429
• New approximation algorithms for the minimum cycle cover problem
• Approximating maximum weight cycle covers in directed graphs with weights zero and one
• On Approximating Restricted Cycle Covers
• Approximation and Online Algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cited In (7)

• 35/44-approximation for asymmetric maximum TSP with triangle inequality
• A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
• Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
• An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles
• Title not available (Why is that?)
• Improved approximation algorithms for some min-max and minimum cycle cover problems
• A 2log2(n)-Approximation Algorithm for Directed Tour Cover

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411276)