scientific article; zbMATH DE number 3882483

zbMATH Open0554.05054MaRDI QIDQ3216698FDOQ3216698

Authors: Meigu Guan 

Publication date: 1984

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

Recommendations

• The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
• Approximation algorithms and hardness results for cycle packing problems
• scientific article; zbMATH DE number 3983209
• Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
• Publication:4944300
• Approximation algorithms for cycle packing problems
• An optimal algorithm for the mixed Chinese postman problem
• On maximum cycle packings in polyhedral graphs
• scientific article; zbMATH DE number 4211828

zbMATH Keywords

Chinese postman problemundirected connected graphmaximum weighted cycle-packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (2)

• Packing cycles exactly in polynomial time
• An algorithm for min-cost edge-disjoint cycles and its applications

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 Q3216698)