Samir Khuller
- Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., and Pandit, V. 2001. Local search heuristics for K-median amd facility location problems. In Proceedings of the Symposium on Theory of Computing. ACM, New York. Google Scholar
Digital Library
- Achlioptas, D., Molloy, M., Moore, M., and van Bussel, V. 2004. Sampling grid colorings with fewer colors. In Proceedings of the 6th Latin American Theoretical Informatics (LATIN 2004).Google ScholarCross Ref
- Bubley, R., Dyer, M., Greenhill, C., and Jerrum, M. 1999. On approximately counting colorings of small degree graphs. SIAM J. Computing 29, 387--400. Google ScholarDigital Library
- Charikar, M., Guha, S., Tardos, E., and Shmoys, D. 1999. A constant factor approximation for the K-median problem. In Proceedings of the Symposium on Theory of Computing. ACM, New York. Google ScholarDigital Library
- Charikar, M., Khuller, S., Mount, D., and Narasimhan, G. 2001. Facility location with outliers. SODA.Google Scholar
- Goldberg, L. A., Martin, R., and Paterson, M. 2004a. Random sampling of 3-colorings in Z2, Rand. Struct. Algor. 24, 3, 279--302. Google ScholarDigital Library
- Goldberg, L. A., Martin, M., and Paterson, M. 2004b. Strong spatial mixing for lattice graphs with fewer colors. In Proceedings of the Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif. Google ScholarDigital Library
- Jerrum, J. 1995. A very simple algorithm for estimating the number of k-colorings of a low-degree graph. Rand. Struct. Algor. 7, 157--165. Google ScholarCross Ref
- Luby, M., Randall, D., and Sinclair, A. J. 2001. Markov chain algorithms for planar lattice structures. SIAM J. Computing 31, 167--192. Google ScholarDigital Library
- Salas, J., and Sokal, A. D. 1997. Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem. J. Stat. Phys. 86, 551--579.Google ScholarCross Ref
Index Terms
- Problems column
Recommendations
Principal Pivoting Method for Solving Column Sufficient Complementarity Problems
The linear complementarity problem (q, A) is to find, for a given real square matrix A of order n and a real column vector q of order n, a nonnegative vector z such that A z + q \geq 0$ and zt(A z + q) =0. It is known that when A is a positive ...
Scaling Matrices to Prescribed Row and Column Maxima
A nonnegative symmetric matrix $B$ has row maxima prescribed by a given vector $r$, if for each index $i$, the maximum entry in the $i$th row of $B$ equals $r_i$. This paper presents necessary and sufficient conditions so that for a given nonnegative ...
A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
A new method for sparse LU factorization is presented that combines a column pre-ordering strategy with a right-looking unsymmetric-pattern multifrontal numerical factorization. The column ordering is selected to give a good a priori upper bound on fill-...
Comments