On the intercluster distance of a tree metric (Q861256): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.056 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043721202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAD trees and distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm to compute a MAD tree of an interval graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average distance in colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4882555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for minimum routing cost trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Communication Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Network Design Problem Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time approximation scheme for the two-source minimum routing cost spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the optimal \(p\)-source communication spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees and Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the shortest total path length spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for some optimum communication spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:25, 25 June 2024

scientific article
Language Label Description Also known as
English
On the intercluster distance of a tree metric
scientific article

    Statements

    On the intercluster distance of a tree metric (English)
    0 references
    0 references
    9 January 2007
    0 references
    graph
    0 references
    tree metric
    0 references
    optimization problem
    0 references
    approximation algorithm
    0 references

    Identifiers