On covering problems of Rado
type: Item
instance of: scholarly article
title: On covering problems of Rado
zbMATH Open document ID: 1201.68136
author: Sergey Bereg
author: Adrian Dumitrescu
author: Minghui Jiang
published in: Algorithmica
publication date: 2010-05-19T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5709224
zbMATH Keywords: discrete geometry
zbMATH Keywords: computational geometry
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
Wikidata QID: Q59485429
full work available at URL: s00453-009-9298-z
OpenAlex ID: W2084366058
cites work: Q5674034
cites work: MAXIMUM AREA INDEPENDENT SETS IN DISK INTERSECTION GRAPHS
cites work: Research Problems in Discrete Geometry
cites work: Polynomial-time approximation schemes for packing and piercing fat objects
cites work: Unsolved problems in geometry
cites work: Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
cites work: Q5795745
cites work: Optimal packing and covering in the plane are NP-complete
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: Q3694703
cites work: Some Covering Theorems (I)
cites work: Some Covering Theorems (II)
cites work: Some Covering Theorems (III)
cites work: Q5776940
cites work: Q3278735
cites work: Q3172797
DBLP publication ID: journals/algorithmica/BeregDJ10
DOI: 10.1007/S00453-009-9298-Z
Recommended article: On Covering Problems of Rado
Recommended article: Q3346346
Recommended article: On the Complexity of Multicovering Radii
Recommended article: Q3991023
Recommended article: Q3971521
Recommended article: Covering Problems
Recommended article: Q4274913
Recommended article: Q3487357
description: scientific article; zbMATH DE number 5709224