Optimization of wireless sensor networks deployment with coverage and connectivity constraints (Q829179): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129618383, #quickstatements; #temporary_batch_1726260318586
 
(8 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Stephane Rovedakis / rank
Normal rank
 
Property / author
 
Property / author: Stephane Rovedakis / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AMPL / 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/s10479-018-2943-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2809700694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-leaves spanning tree is APX-hard for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grid coverage for surveillance and target location in distributed sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum leaf spanning tree problem. / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological design of centralized computer networks—formulations and algorithms / 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: The Domination Number of Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / 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: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensor deployment optimization methods to achieve both coverage and connectivity in wireless sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the maximum leaf spanning tree problem on planar and regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-based formulation for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129618383 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:46, 13 September 2024

scientific article
Language Label Description Also known as
English
Optimization of wireless sensor networks deployment with coverage and connectivity constraints
scientific article

    Statements

    Optimization of wireless sensor networks deployment with coverage and connectivity constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 May 2021
    0 references
    wireless sensor networks
    0 references
    grid networks
    0 references
    random graphs
    0 references
    sensor deployment
    0 references
    minimum connected \(k\)-coverage
    0 references
    mixed integer linear programming
    0 references
    formulations
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references