Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems (English)
National licence
- New search for: Karpinski, M.
- New search for: Karpinski, M.
In:
Algorithmica
;
30
, 3
;
386-397
;
2001
- Article (Journal) / Electronic Resource
-
Title:Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems
-
Contributors:Karpinski, M. ( author )
-
Published in:Algorithmica ; 30, 3 ; 386-397
-
Publisher:
- New search for: Springer-Verlag
-
Place of publication:Berlin/Heidelberg
-
Publication date:2001-01-01
-
Size:12 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents – Volume 30, Issue 3
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 351
-
Guest Editors' IntroductionJansen, K. / Rolim, J. et al. | 2001
- 353
-
On Rooted Node-Connectivity ProblemsCheriyan, J. / Jordán, T. / Nutov, Z. et al. | 2001
- 376
-
Random Sampling of Euler ToursTetali, P. / Vempala, S. et al. | 2001
- 386
-
Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization ProblemsKarpinski, M. et al. | 2001
- 398
-
Best Possible Approximation Algorithm for MAX SAT with Cardinality ConstraintSviridenko, M. I. et al. | 2001
- 406
-
An Approximation Algorithm for Circular Arc ColouringKumar, V. et al. | 2001
- 418
-
Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication ProtocolsSaks, M. / Zhou, S. et al. | 2001
- 432
-
On the Hardness of Approximating SpannersKortsarz, G. et al. | 2001
- 451
-
Approximation of Geometric Dispersion ProblemsBaur, C. / Fekete, S. P. et al. | 2001