A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (Q5085993): 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.1287/ijoc.2021.1106 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3213046113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakout local search for maximum clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakout local search for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive Flex-Deluge Approach to University Exam Timetabling / 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: The regenerator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum-leaf spanning tree problem: Formulations and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient local search heuristic with row weighting for the unicost set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric tabu-search for mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with a constraint on the number of leaves. A new formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting connected dominating sets: an almost optimal local information algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulations and solution algorithms for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-based formulation for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: The broadcast storm problem in a mobile ad hoc network / rank
 
Normal rank
Property / cites work
 
Property / cites work: BROADCASTING IN AD HOC NETWORKS BASED ON SELF-PRUNING / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted swap-based neighborhood search for the minimum connected dominating set problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:04, 29 July 2024

scientific article; zbMATH DE number 7551212
Language Label Description Also known as
English
A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
scientific article; zbMATH DE number 7551212

    Statements

    A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2022
    0 references
    0 references
    metaheuristic
    0 references
    minimum dominating set
    0 references
    vertex weighting
    0 references
    local search
    0 references
    search space reduction
    0 references
    0 references
    0 references
    0 references