An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure preserving reductions among convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a unified approach for the classification of NP-complete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wavelength Management in WDM Rings to Maximize the Number of Connections / 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: On an approximation measure founded on the links between optimization and polynomial approximation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential approximation algorithms for some combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725269 / 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: Q4886045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: z-Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / 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

Latest revision as of 02:12, 2 July 2024

scientific article
Language Label Description Also known as
English
An Improved Approximation Bound for Spanning Star Forest and Color Saving
scientific article

    Statements

    An Improved Approximation Bound for Spanning Star Forest and Color Saving (English)
    0 references
    0 references
    0 references
    0 references
    16 October 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references