Incremental Network Design with Minimum Spanning Trees (Q2971398): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3102662246 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57955278 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1306.1926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergency path restoration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network construction problems with due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental network design with shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on bases in dependence structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for updating minimal spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsification—a technique for speeding up dynamic graph algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental network design with maximum flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Survivable Networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interdependent network restoration: on the value of information-sharing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding and Updating Spanning Trees and Shortest Paths / rank
 
Normal rank

Latest revision as of 15:53, 13 July 2024

scientific article
Language Label Description Also known as
English
Incremental Network Design with Minimum Spanning Trees
scientific article

    Statements

    Incremental Network Design with Minimum Spanning Trees (English)
    0 references
    0 references
    0 references
    5 April 2017
    0 references

    Identifiers

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