Light graphs with small routing cost (Q4537619): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Chuan Yi Tang / rank
Normal rank
 
Property / author
 
Property / author: Chuan Yi Tang / rank
 
Normal rank
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.1002/net.10019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975752629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse spanners of weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of minimum spanner problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Selection and Ranking: Sorted Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum diameter spanning tree problem / 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: Balancing minimum spanning trees and shortest-path trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of designing a network with minimum diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum of all distances in a graph or digraph / 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: 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 10:22, 4 June 2024

scientific article; zbMATH DE number 1762009
Language Label Description Also known as
English
Light graphs with small routing cost
scientific article; zbMATH DE number 1762009

    Statements

    Light graphs with small routing cost (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 July 2002
    0 references
    approximation algorithms
    0 references
    network design
    0 references
    spanning trees
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references