Special issue: APPROX-RANDOM 2012: guest editors' foreword

DOI10.4086/TOC.2013.V009A012MaRDI QIDQ3191581zbMATH OpenOpenAlexFDO

Authors

Publication date 6 October 2014

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2013.v009a012

zbMATH Keywords

APPROX-RANDOM 2012forewordspecial issue

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Special issue: APPROX-RANDOM 2014. Guest editors' foreword
• scientific article; zbMATH DE number 7166708
• Special issue: APPROX-RANDOM 2015. Guest editors' foreword
• Special issue: APPROX-RANDOM 2013. Guest editors' foreword
• Special issue: APPROX-RANDOM 2019: Guest editors' foreword

Cited in

(7)

• Randomization, approximation, and combinatorial optimization. Algorithms and techniques. 3rd international workshop on Randomization and approximation techniques in computer science, and 2nd international workshop on Approximation algorithms for combinatorial optimization problems RANDOM-APPROX '99. Berkeley, CA, USA, August 8--11, 1999. Proceedings
• Special issue: APPROX-RANDOM 2014. Guest editors' foreword
• Special issue: APPROX-RANDOM 2015. Guest editors' foreword
• Special issue: APPROX-RANDOM 2013. Guest editors' foreword
• Special issue: APPROX-RANDOM 2019: Guest editors' foreword
• scientific article; zbMATH DE number 7166708 (Why is no real title available?)
• Preface to the special issue on developments of the concepts of randomness, statistics and probability

This page was built for publication: Special issue: APPROX-RANDOM 2012: guest editors' foreword

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191581)