An efficient local search framework for the minimum weighted vertex cover problem (Q2282264): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NuMVC / 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.ins.2016.08.053 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2509952555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized Crossover for the Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel evolutionary formulation of the maximum independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum independent set problem in subclasses of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weighted \(k\)-path vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search for Boolean satisfiability with configuration checking and subscore / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with edge weighting and configuration checking heuristics for minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relationship between attribute reducts in rough sets and minimal vertex covers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent sets in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advice complexity of maximum independent set in sparse and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of vertex cover and edge cover with connectivity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental learning for \(\nu\)-support vector regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense community detection in multi-valued attributed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary search for the minimum sum coloring problem of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solutions to generalized vertex covering problems: a comparison of two models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the MAX algorithm for maximum independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring the impact of MVC attack in large complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal topological design for distributed estimation over sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3623999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ant colony optimization algorithm for the minimum weight vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed-parameter algorithm for the vertex cover \(P_3\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs / rank
 
Normal rank

Latest revision as of 09:53, 21 July 2024

scientific article
Language Label Description Also known as
English
An efficient local search framework for the minimum weighted vertex cover problem
scientific article

    Statements

    An efficient local search framework for the minimum weighted vertex cover problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 January 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    minimum weighted vertex cover
    0 references
    weighted configuration checking
    0 references
    scoring strategy
    0 references
    local search
    0 references
    massive graph instances
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references