Randomized Approximation Techniques

[1]  Paul G. Spirakis,et al.  Radiocoloring in planar graphs: Complexity and approximations , 2005, Theor. Comput. Sci..

[2]  Juraj Hromkovič.  Design and Analysis of Randomized Algorithms , 2005 .

[3]  Paul G. Spirakis,et al.  On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE -completeness and Approximations , 2002, Algorithms, Probability, Networks, and Games.

[4]  Paul G. Spirakis,et al.  Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies , 2002, J. Discrete Algorithms.

[5]  Paul G. Spirakis,et al.  Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring , 2001, Comput. Artif. Intell..

[6]  Mahmoud Naghshineh,et al.  Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey , 2000, IEEE Communications Surveys & Tutorials.

[7]  M. Habib.  Probabilistic methods for algorithmic discrete mathematics , 1998 .

[8]  Mark Jerrum,et al.  Mathematical Foundations of the Markov Chain Monte Carlo Method , 1998 .

[9]  Paul G. Spirakis,et al.  Frequency assignment in mobile and radio networks , 1997, Networks in Distributed Computing.

[10]  D. Hochbaum.  Approximation Algorithms for NP-Hard Problems , 1996 .

[11]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[12]  Mark Jerrum,et al.  A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph , 1995, Random Struct. Algorithms.

[13]  Aravind Srinivasan,et al.  Improved approximations of packing and covering problems , 1995, STOC '95.

[14]  Lars Eilstrup Rasmussen,et al.  Approximating the Permanent: A Simple Approach , 1994, Random Struct. Algorithms.

[15]  Alan A. Bertossi,et al.  Code assignment for hidden terminal interference avoidance in multihop packet radio networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[16]  P. Diaconis.  Group representations in probability and statistics , 1988 .

[17]  Marc Yor,et al.  Séminaire de Probabilités XVII 1981/82 , 1983 .

[18]  D. Aldous.  Random walks on finite groups and rapidly mixing markov chains , 1983 .

[19]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[20]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  D. Knuth.  Estimating the efficiency of backtrack programs. , 1974 .