On fair covering and hitting problems (Q2672421)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On fair covering and hitting problems	scientific article

Statements

scholarly article

0 references

On fair covering and hitting problems (English)

0 references

Sayan Bandyapadhyay

0 references

0 references

0 references

publication date

8 June 2022

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-86838-3_4

0 references

A Technique for Obtaining True Approximations for k-Center with Covering Constraints

0 references

0 references

Approximation algorithms for the partition vertex cover problem

0 references

Partial Vertex Cover and Budgeted Maximum Coverage in Bipartite Graphs

0 references

Tropical matchings in vertex-colored graphs

0 references

0 references

Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses

0 references

0 references

0 references

Approximation algorithms for hitting objects with straight lines

0 references

On Partial Covering For Geometric Set Systems

0 references

Fair Colorful k-Center Clustering

0 references

Point Line Cover

0 references

0 references

Covering things with things

0 references

Iterative Methods in Combinatorial Optimization

0 references

On the complexity of locating linear facilities in the plane

0 references

Improved performance of the greedy algorithm for partial cover

0 references

Identifiers

10.1007/978-3-030-86838-3_4

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2672421

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2672421&oldid=36814165"