Capacitated Covering Problems in Geometric Spaces (Q5115774): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Capacitated Covering Problems in Geometric Spaces
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.SoCG.2018.7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Replica placement on bounded treewidth graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centrality of trees for capacitated \(k\)-center / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-Based Algorithms for Capacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Allocate Network Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated domination problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for geometric and capacitated set cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Switching to directional antennas with constant increase in radius and hop distance / 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: Q5743501 / 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: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for vertex cover with hard capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the cardinality constrained covering with unit balls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and Covering with Non-Piercing Regions / 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: Iterative Partial Rounding for Vertex Cover with Hard Capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated <i>K</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for base station coverage with minimum total radii / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-based approximation algorithms for capacitated facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Uniform Capacitated <i>k</i>-Median Beyond the Natural LP Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic / 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: Weighted geometric set cover via quasi-uniform sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/LIPIcs.SoCG.2018.7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2772875134 / rank
 
Normal rank
Property / title
 
Capacitated Covering Problems in Geometric Spaces (English)
Property / title: Capacitated Covering Problems in Geometric Spaces (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.SOCG.2018.7 / rank
 
Normal rank

Latest revision as of 15:59, 30 December 2024

scientific article; zbMATH DE number 7236411
Language Label Description Also known as
English
Capacitated Covering Problems in Geometric Spaces
scientific article; zbMATH DE number 7236411

    Statements

    0 references
    0 references
    0 references
    0 references
    18 August 2020
    0 references
    capacitated covering
    0 references
    geometric set cover
    0 references
    LP rounding
    0 references
    bi-criteria approximation
    0 references
    0 references
    Capacitated Covering Problems in Geometric Spaces (English)
    0 references

    Identifiers