Exact and approximation algorithms for geometric and capacitated set cover problems (Q1759660): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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: Almost optimal set covers in finite VC-dimension / 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: Q3619797 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Resource constrained scheduling as generalized bin packing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / 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: An efficient fully polynomial approximation scheme for the Subset-Sum problem. / rank | |||
Normal rank |
Latest revision as of 22:32, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Exact and approximation algorithms for geometric and capacitated set cover problems |
scientific article |
Statements
Exact and approximation algorithms for geometric and capacitated set cover problems (English)
0 references
21 November 2012
0 references
set cover
0 references
geometric set cover
0 references
capacitated set cover
0 references
assignment of directional antenna
0 references
shipping with deadlines
0 references
approximation algorithms
0 references
polynomial-time approximation scheme
0 references
APX-hardness
0 references
exact algorithms
0 references
time complexity
0 references