Improved approximation for spanning star forest in dense graphs (Q1944390): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jing (Selena) He / rank
Normal rank
 
Property / author
 
Property / author: Jing (Selena) He / 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.1007/s10878-012-9499-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033780447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation Bound for Spanning Star Forest and Color Saving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation bounds for edge dominating set in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Subdense Instances of Covering Problems / 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: Improved Approximation Algorithms for the Spanning Star Forest Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential time algorithms for the minimum dominating set problem on some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921716 / 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: Q4527015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems remaining NP-complette for sparse or dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev's approximation algorithms and applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:09, 6 July 2024

scientific article
Language Label Description Also known as
English
Improved approximation for spanning star forest in dense graphs
scientific article

    Statements

    Improved approximation for spanning star forest in dense graphs (English)
    0 references
    0 references
    0 references
    25 March 2013
    0 references
    spanning star forest
    0 references
    dense graph
    0 references
    approximation algorithm
    0 references
    hardness of approximation
    0 references

    Identifiers