Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear vertex kernel for maximum internal spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp separation and applications to exact and parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum leaf out-branching and related problems / 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: A randomized linear-time algorithm to find minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better approximation algorithms for the maximum internal spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits and Applications of Group Algebras for Parameterized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2k-vertex Kernel for Maximum Internal Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Leaf Spanning Trees in Almost Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3369936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the maximum internal spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2861557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding spanning trees with few leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms -- ESA 2014. 22nd annual European symposium, Wrocław, Poland, September 8--10, 2014. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representative Families: A Unified Tradeoff-Based Approach / rank
 
Normal rank

Latest revision as of 04:37, 13 July 2024

scientific article
Language Label Description Also known as
English
Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
scientific article

    Statements

    Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 December 2016
    0 references
    maximum internal spanning tree
    0 references
    parameterized computation
    0 references
    local search
    0 references
    0 references
    0 references

    Identifiers