AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS (Q2929639): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exact and approximation algorithms for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized submodular cover problems and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-facility location-allocation problem with polyhedral barriers / 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: On a circle placement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Problems with Hard Capacities / 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: AN IMPROVED LINE-SEPARABLE ALGORITHM FOR DISCRETE UNIT DISK COVER / 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: Approximation algorithms for partial covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the most points covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a set of points in multidimensional space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-Center Problem with Obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for computing the smallest \(k\)-enclosing circle / 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: Improved results on geometric hitting set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Analysis of the Greedy Algorithm for Set Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / rank
 
Normal rank

Latest revision as of 07:45, 9 July 2024

scientific article
Language Label Description Also known as
English
AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS
scientific article

    Statements

    AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS (English)
    0 references
    0 references
    0 references
    0 references
    14 November 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    geometric covering
    0 references
    covering with disks
    0 references
    covering with obstacles
    0 references
    covering with sectors
    0 references
    set cover problem
    0 references
    algorithmic framework
    0 references
    approximation algorithm
    0 references
    computational geometry
    0 references