Approximation algorithms for the weighted independent set problem in sparse graphs (Q1028454): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2008.08.027 / 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/j.dam.2008.08.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2103011134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation properties of the independent set problem for low degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximations for weighted and unweighted graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations of Weighted Independent Set and Hereditary Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-degree Graph Partitioning via Local Search with Applications to Constraint Satisfaction, Max Cut, and Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greed is good: Approximating independent sets in sparse and bounded-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient bounds for the stable set, vertex cover and set packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate graph coloring by semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest-last ordering and clustering and graph coloring algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on greedy algorithms for the maximum weighted independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2008.08.027 / rank
 
Normal rank

Latest revision as of 13:44, 10 December 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for the weighted independent set problem in sparse graphs
scientific article

    Statements

    Approximation algorithms for the weighted independent set problem in sparse graphs (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2009
    0 references
    weighted independent set problem
    0 references
    approximation algorithm
    0 references
    weighted degree
    0 references

    Identifiers