Approximation Algorithms for Generalized Bounded Tree Cover (Q2803829): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Approximations for minimum and min-max vehicle routing problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Min-max tree covers of graphs. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Saving an epsilon / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation Algorithms for Min–Max Tree Partition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation algorithms for distance constrained vehicle routing problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Clustering on Graphs with Multiple Edge Types / rank | |||
Normal rank |
Latest revision as of 21:35, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation Algorithms for Generalized Bounded Tree Cover |
scientific article |
Statements
Approximation Algorithms for Generalized Bounded Tree Cover (English)
0 references
3 May 2016
0 references
tree cover
0 references
TSP
0 references
\(k\)-MST
0 references
approximation algorithms
0 references
0 references