A PTAS for a disc covering problem using width-bounded separators (Q2498985): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-006-7132-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060662766 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Planar Separators / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational Science and Its Applications – ICCSA 2004 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2708237 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Problem of Partitioning Planar Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Automata, Languages and Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Separator Theorem for Planar Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4339095 / rank | |||
Normal rank | |||
Latest revision as of 18:50, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A PTAS for a disc covering problem using width-bounded separators |
scientific article |
Statements
A PTAS for a disc covering problem using width-bounded separators (English)
0 references
14 August 2006
0 references
width-bounded separator
0 references
disc covering
0 references
approximation algorithms
0 references
randomized algorithms
0 references
polynomial time approximation scheme
0 references
