Mixed covering of trees and the augmentation problem with odd diameter constraints (Q5899375): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081238923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting trees to meet biconnectivity and diameter constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed covering of trees and the augmentation problem with odd diameter constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design networks with bounded pairwise distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Coverage Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter increase caused by edge deletion / rank
 
Normal rank

Latest revision as of 20:09, 25 June 2024

scientific article; zbMATH DE number 5158198
Language Label Description Also known as
English
Mixed covering of trees and the augmentation problem with odd diameter constraints
scientific article; zbMATH DE number 5158198

    Statements

    Mixed covering of trees and the augmentation problem with odd diameter constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    partial covering
    0 references
    diameter
    0 references
    augmentation problem
    0 references
    dynamical programming
    0 references
    approximation algorithms
    0 references
    0 references