A PTAS for the Weighted Unit Disk Cover Problem (Q3448847): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1655323853 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1502.04918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Geometry of Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal set covers in finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter estimates for \(\epsilon\)-nets for disks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms and APX-hardness results for geometric packing and covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for geometric set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for Weighted Set Cover on Unit Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting sets when the VC-dimension is small / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: WEIGHTED GEOMETRIC SET COVER PROBLEMS REVISITED / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for a nonconvex covering problem / 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: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for geometric hitting set problems via local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: New existence proofs ε-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epsilon nets and union complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted geometric set cover via quasi-uniform sampling / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:48, 10 July 2024

scientific article
Language Label Description Also known as
English
A PTAS for the Weighted Unit Disk Cover Problem
scientific article

    Statements

    A PTAS for the Weighted Unit Disk Cover Problem (English)
    0 references
    0 references
    0 references
    27 October 2015
    0 references
    0 references
    0 references

    Identifiers

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