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

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q5920147
description / endescription / en
 
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

Revision as of 08:54, 6 May 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