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

@@ label / en / label / en @@
+Capacitated Covering Problems in Geometric Spaces
@@ Property / DOI @@
-.4230/LIPIcs.SoCG.2018.7
@@ Property / DOI: 10.4230/LIPIcs.SoCG.2018.7 / rank @@
-Normal rank
@@ Property / author @@
-Kasturi R. Varadarajan
@@ Property / author: Kasturi R. Varadarajan / rank @@
-Normal rank
@@ Property / author @@
+Kasturi R. Varadarajan
@@ Property / author: Kasturi R. Varadarajan / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Replica placement on bounded treewidth graphs
@@ Property / cites work: Replica placement on bounded treewidth graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Centrality of trees for capacitated \(k\)-center
@@ Property / cites work: Centrality of trees for capacitated \(k\)-center / rank @@
+Normal rank
@@ Property / cites work @@
+LP-Based Algorithms for Capacitated Facility Location
+Normal rank
@@ Property / cites work @@
+Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
+Normal rank
@@ Property / cites work @@
+How to Allocate Network Centers
@@ Property / cites work: How to Allocate Network Centers / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated domination problems on planar graphs
@@ Property / cites work: Capacitated domination problems on planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and approximation algorithms for geometric and capacitated set cover problems
+Normal rank
@@ Property / cites work @@
+Switching to directional antennas with constant increase in radius and hop distance
+Normal rank
@@ Property / cites work @@
+Almost optimal set covers in finite VC-dimension
@@ Property / cites work: Almost optimal set covers in finite VC-dimension / rank @@
+Normal rank
@@ Property / cites work @@
+Q5743501
@@ Property / cites work: Q5743501 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering Problems with Hard Capacities
@@ Property / cites work: Covering Problems with Hard Capacities / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for geometric set cover
+Normal rank
@@ Property / cites work @@
+Analytical approach to parallel repetition
@@ Property / cites work: Analytical approach to parallel repetition / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for vertex cover with hard capacities
+Normal rank
@@ Property / cites work @@
+A PTAS for the cardinality constrained covering with unit balls
+Normal rank
@@ Property / cites work @@
+Packing and Covering with Non-Piercing Regions
@@ Property / cites work: Packing and Covering with Non-Piercing Regions / rank @@
+Normal rank
@@ Property / cites work @@
+WEIGHTED GEOMETRIC SET COVER PROBLEMS REVISITED
@@ Property / cites work: WEIGHTED GEOMETRIC SET COVER PROBLEMS REVISITED / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+Iterative Partial Rounding for Vertex Cover with Hard Capacities
+Normal rank
@@ Property / cites work @@
+The Capacitated <i>K</i>-Center Problem
@@ Property / cites work: The Capacitated <i>K</i>-Center Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for base station coverage with minimum total radii
+Normal rank
@@ Property / cites work @@
+LP-based approximation algorithms for capacitated facility location
+Normal rank
@@ Property / cites work @@
+On Uniform Capacitated <i>k</i>-Median Beyond the Natural LP Relaxation
+Normal rank
@@ Property / cites work @@
+Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic
+Normal rank
@@ Property / cites work @@
+Improved results on geometric hitting set problems
+Normal rank
@@ Property / cites work @@
+Weighted geometric set cover via quasi-uniform sampling
+Normal rank
@@ Property / cites work @@
+An analysis of the greedy algorithm for the submodular set covering problem
+Normal rank
@@ Property / cites work @@
+Tight Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.4230/LIPIcs.SoCG.2018.7
+Normal rank
@@ Property / OpenAlex ID @@
+W2772875134
@@ Property / OpenAlex ID: W2772875134 / rank @@
+Normal rank
@@ Property / title @@
+Capacitated Covering Problems in Geometric Spaces (English)
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.SOCG.2018.7
@@ Property / DOI: 10.4230/LIPICS.SOCG.2018.7 / rank @@
+Normal rank