Min-max tree covers of graphs. (Q703232): 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: Q4947393 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4471355 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / 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: Q3799801 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Vehicle Routing Problem / rank | |||
Normal rank |
Latest revision as of 16:05, 7 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Min-max tree covers of graphs. |
scientific article |
Statements
Min-max tree covers of graphs. (English)
0 references
11 January 2005
0 references
Approximation algorithms
0 references
Graphs
0 references
Location routing
0 references
Clustering
0 references