Approximating the Spanning k-Tree Forest Problem (Q5321721): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/978-3-642-02270-8_30 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1606114348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finding optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling algorithms for domination problems in sun-free chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Spanning Star Forest Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4029974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diversity of domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple derivation of edmonds' algorithm for optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-tuple domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Spanning Star Forest Problem and Its Application to Genomic Sequence Alignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>R</i> -Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:28, 1 July 2024

scientific article; zbMATH DE number 5578485
Language Label Description Also known as
English
Approximating the Spanning k-Tree Forest Problem
scientific article; zbMATH DE number 5578485

    Statements

    Approximating the Spanning k-Tree Forest Problem (English)
    0 references
    0 references
    0 references
    14 July 2009
    0 references
    0 references
    spanning forest
    0 references
    \(k\)-tree
    0 references
    star
    0 references
    approximation algorithm
    0 references
    0 references