Multiobjective Disk Cover Admits a PTAS

Authors:
Christian Glaßer;Christian Reitwießner;Heinz Schmitz
Affiliations:
Julius-Maximilians-Universität Würzburg, Germany;Julius-Maximilians-Universität Würzburg, Germany;Fachhochschule Trier, Germany
Venue:
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Year:
2008

Citing 0
Cited 2

Latency Constrained Aggregation in Chain Networks Admits a PTAS

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
PTAS for weighted set cover on unit squares

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this talk I will present a new direction of algorithms whichdo not use any extra working array. More formally, we want todesign efficient algorithms which require no extra array of sizedepending on input size n but use only constant ...