Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
description / endescription / en
scientific article; zbMATH DE number 7118907
scientific article; zbMATH DE number 6796719
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1431.68150 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-62389-4_11 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
23 October 2017
Timestamp+2017-10-23T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 23 October 2017 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6796719 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3165702993 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1608.03299 / rank
 
Normal rank
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: An approximation algorithm for maximum 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: Q4198056 / 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: 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: A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs / 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: 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: On finding spanning trees with few leaves / rank
 
Normal rank

Latest revision as of 17:50, 20 July 2024

scientific article; zbMATH DE number 6796719
Language Label Description Also known as
English
Approximation algorithms for the maximum weight internal spanning tree problem
scientific article; zbMATH DE number 6796719

    Statements

    Approximation algorithms for the maximum weight internal spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 October 2019
    0 references
    23 October 2017
    0 references
    maximum weight internal spanning tree
    0 references
    maximum weight matching
    0 references
    approximation algorithm
    0 references
    performance analysis
    0 references

    Identifiers

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