Simple heuristics for the rooted max tree coverage problem

DOI10.1007/978-3-031-49611-0_18MaRDI QIDQ6606188

Jiang Zhou, Peng Zhang

Publication date: 16 September 2024

zbMATH Keywords

combinatorial optimizationmeta-heuristic\(k\)-MSTCMSAmax tree coverage

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
• Finding happiness: an analysis of the maximum happy vertices problem
• Improved algorithms for orienteering and related problems
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
• Spanning Trees—Short or Small
• Approximation Algorithms for Orienteering and Discounted-Reward TSP

This page was built for publication: Simple heuristics for the rooted max tree coverage problem

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