Minimax flow tree problems (Q3057112): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1002/net.20313 / 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.20313 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3217798671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating \(k\)-hop minimum-spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network design for time‐constrained delivery / 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: The 2-hop spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flow models for spanning trees with hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / 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: Off-Line Maintenance of Planar Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Diameter Spanning Trees and Related Problems / 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: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-source spanning trees: Algorithms for minimizing source eccentricities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shipment Routing Algorithms with Tree Constraints / 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: An improved algorithm for the \(k\)-source maximum eccentricity spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for some optimum communication spanning tree problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.20313 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:06, 20 December 2024

scientific article
Language Label Description Also known as
English
Minimax flow tree problems
scientific article

    Statements

    Minimax flow tree problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 2010
    0 references
    trees
    0 references
    minimax
    0 references
    flow
    0 references
    complexity
    0 references
    shortest path trees
    0 references
    0 references
    0 references
    0 references

    Identifiers

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