A short note on the approximability of the maximum leaves spanning tree problem (Q1336751): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Giulia Galbiati / rank
Normal rank
 
Property / author
 
Property / author: Francesco Maffioli / rank
Normal rank
 
Property / author
 
Property / author: Angelo Morzenti / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q29011645 / rank
 
Normal rank
Property / author
 
Property / author: Giulia Galbiati / rank
 
Normal rank
Property / author
 
Property / author: Francesco Maffioli / rank
 
Normal rank
Property / author
 
Property / author: Angelo Morzenti / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(94)90139-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035040468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness in approximation classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing systems in spite of distributed control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3928248 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:12, 23 May 2024

scientific article
Language Label Description Also known as
English
A short note on the approximability of the maximum leaves spanning tree problem
scientific article

    Statements

    A short note on the approximability of the maximum leaves spanning tree problem (English)
    0 references
    26 February 1996
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references