Minimizing the total cost of barrier coverage in a linear domain (Q721928): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129812887, #quickstatements; #temporary_batch_1725411297270
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-018-0306-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2804580808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the aggregate movements for interval coverage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Barrier Coverage Lifetime with Mobile Sensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Points by Unit Disks of Fixed Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal point movement for covering circular regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the disk cover problem of geometric objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak coverage of a rectangular barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better constant-factor approximation for weighted dominating set in unit disk graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverage by randomly deployed wireless sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Novel Node Placement for Long Belt Coverage in Wireless Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Maximum Moving Cost of Interval Coverage / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient privacy-preserving compressive data gathering scheme in WSNs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129812887 / rank
 
Normal rank

Latest revision as of 02:55, 4 September 2024

scientific article
Language Label Description Also known as
English
Minimizing the total cost of barrier coverage in a linear domain
scientific article

    Statements

    Minimizing the total cost of barrier coverage in a linear domain (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    wireless sensor networks
    0 references
    barrier coverage
    0 references
    range assignment
    0 references
    approximation algorithm
    0 references
    0 references
    0 references