On the complexity of constructing minimum changeover cost arborescences (Q2453161): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2014.03.023 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On minimum reload cost paths, tours, and flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimum Changeover Cost Arborescences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reload cost problems: Minimum diameter spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of a minimum reload cost diameter problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum reload cost cycle cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum reload \(s-t\) path, trail and walk problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reload cost trees and network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526990 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2014.03.023 / rank
 
Normal rank

Latest revision as of 17:48, 18 December 2024

scientific article
Language Label Description Also known as
English
On the complexity of constructing minimum changeover cost arborescences
scientific article

    Statements

    On the complexity of constructing minimum changeover cost arborescences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 June 2014
    0 references
    reload cost
    0 references
    changeover cost
    0 references
    approximation algorithms
    0 references
    network design
    0 references
    network optimization
    0 references

    Identifiers

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