scientific article; zbMATH DE number 3882483

MaRDI QIDQ3216698zbMATH OpenFDO

Authors Meigu Guan

Publication date 1984

zbMATH Keywords

Chinese postman problemmaximum weighted cycle-packingundirected connected graph

Mathematics Subject Classification ID

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

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

Cited in

(2)

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

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)