Work

Almost optimal set covers in finite VC-dimension

Year: 1995

Type: article

Source: Discrete & Computational Geometry

DOI: 10.1007/bf02570718

Authors: H. Brönnimann, M. T. Goodrich

Institutions: Princeton University, Johns Hopkins University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, Defense Advanced Research Projects Agency

Awards: Paradigms for Parallel Algorithm Design, Constructing, Maintaining, and Searching Geometric Structures

OpenAlex ID: W2022671649

FWCI: 10.3

Cites: 60

Cited by: 461

Related to: 10