Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem

accepted for publication

    Export metadata

    Additional Services

    Share in Twitter Search Google Scholar
    Metadaten
    Author:Daniel Rehfeldt, Thorsten Koch
    Document Type:Article
    Parent Title (English):SIAM Journal on Optimization
    Year of first publication:2018
    Preprint:urn:nbn:de:0297-zib-64699