Pages that link to "Item:Q2380018"

The following pages link to Approximating the minmax rooted-tree cover in a tree (Q2380018):

Displaying 22 items.

• Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
• Covering directed graphs by in-trees (Q626455) (← links)
• Approximating the tree and tour covers of a graph (Q688437) (← links)
• Min-max tree covers of graphs. (Q703232) (← links)
• Approximation results for a min-max location-routing problem (Q765374) (← links)
• Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
• Optimal direct and indirect covering trees (Q1417719) (← links)
• Min-max cover of a graph with a small number of parts (Q1751107) (← links)
• A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840) (← links)
• On optimal coverage of a tree with multiple robots (Q2184041) (← links)
• Online graph exploration algorithms for cycles and trees by multiple searchers (Q2251142) (← links)
• Extremal cover cost and reverse cover cost of trees with given segment sequence (Q2297740) (← links)
• Minmax subtree cover problem on cacti (Q2495907) (← links)
• Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
• Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems (Q3196380) (← links)
• A minimum-length covering subtree of a tree (Q3479805) (← links)
• Covering Directed Graphs by In-Trees (Q3511356) (← links)
• How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover (Q3613779) (← links)
• Algorithms and Computation (Q5712159) (← links)
• Minmax Tree Cover in the Euclidean Space (Q5901435) (← links)
• Mixed covering of trees and the augmentation problem with odd diameter constraints (Q5920611) (← links)
• (Q6084420) (← links)