scientific article; zbMATH DE number 7525449
From MaRDI portal
Publication:5075746
DOI10.4230/LIPIcs.ESA.2019.12MaRDI QIDQ5075746
Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi R. Varadarajan
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1907.08906
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
A Technique for Obtaining True Approximations for k-Center with Covering Constraints ⋮ Fair Colorful k-Center Clustering ⋮ Approximation algorithms for clustering with dynamic points ⋮ On fair covering and hitting problems ⋮ Efficient algorithms for fair clustering with a new notion of fairness ⋮ On colorful vertex and edge cover problems ⋮ Groups burning: analyzing spreading processes in community-based networks ⋮ Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints ⋮ Approximation algorithms for diversity-bounded center problems ⋮ A parameterized approximation scheme for generalized partial vertex cover ⋮ An approximation algorithm for diversity-aware fair \(k\)-supplier problem ⋮ Robust \(k\)-center with two types of radii ⋮ Robust \(k\)-center with two types of radii ⋮ Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model ⋮ A technique for obtaining true approximations for \(k\)-center with covering constraints ⋮ Fair colorful \(k\)-center clustering
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matroid and knapsack center problems
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Approximation algorithms for the partition vertex cover problem
- Clustering to minimize the maximum intercluster distance
- Easy and hard bottleneck location problems
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Budgeted Red-Blue Median and Its Generalizations
- A Best Possible Heuristic for the k-Center Problem
- Approximation schemes for covering and packing problems in image processing and VLSI
- Random pseudo-polynomial algorithms for exact matroid problems
- Approximation Schemes for Clustering with Outliers
- A Lottery Model for Center-Type Problems with Outliers
- On Partial Covering For Geometric Set Systems
- Constant approximation for k-median and k-means with outliers via iterative rounding
This page was built for publication:
