Chi-Jen Lu  Home/Search
Context Related
| umass.edu/~cjlu/pub/col.ps sinica.edu.tw/~cjlu/pub/col.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umass.edu/~cjlu/paper (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Given a hypergraph and a set of colors, we want to find a vertex coloring to minimize the size of any monochromatic set in an edge. We give deterministic polynomial time approximation algorithms with performances close to the best bounds guaranteed by existential arguments. This can be applied to support divide and conquer approaches to various problems. We give two examples. For deterministic DNF approximate counting, this helps us explore the importance of a previously ignored parameter, the... (Update)
Context of citations to this paper: More
.... probability, a solution that is feasible and not too large can be encountered [12] A simple randomized algorithm, discussed by Lu [13], computes a solution within an approximation ratio not too far from the one given by Srinivasan. This algorithm proceeds by successive...
.... with positive probability, a solution that is feasible and not too large can be encountered [Sri96] A simple algorithm, discussed in Lu [Lu98] can compute a solution that is not too far from the one proposed by Srinivasan. It is a simple randomized algorithm that takes c as...
Cited by: More
Testing Hypergraph Coloring - Czumaj, Sohler (2001) (Correct)
Models, Complexity and Algorithms for the Design.. - Ferreira.. (Correct)
Models, Complexity and Algorithms for The Design.. - Ferreira.. (2003) (Correct)
Active bibliography (related documents): More All
0.4: An Algorithmic Approach to the General Lovász Local.. - Czumaj, Scheideler (2000) (Correct)
0.4: A New Algorithmic Approach to the General Lovász Local.. - Czumaj, al. (Correct)
0.3: Approximation Algorithms Via Randomized Rounding: A Survey - Srinivasan (Correct)
Similar documents based on text: More All
0.2: CS37501-1 Randomized Algorithms Winter 2003 - Lecture January Lecturer (Correct)
0.1: A Deterministic Approximation Algorithm for a Minmax Integer.. - Lu (1999) (Correct)
0.0: On Learning Monotone DNF under Product Distributions - Servedio (2001) (Correct)
Related documents from co-citation: More All
5: Fractional path coloring with applications to WDM networks - Caragiannis, Ferreira et al. - 2001
5: Routing and wavelength assignment in all-optical networks - Ramaswami, Sivarajan - 1995
5: A Column Generation Approach for Graph Coloring - Mehrotra, Trick - 1996
BibTeX entry: (Update)
C.-J. Lu, Deterministic hypergraph coloring and its applications, in Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science, pages 35-46, 1998. http://citeseer.ist.psu.edu/lu98deterministic.html More
@article{ lu98deterministic,
author = "Chi-Jen Lu",
title = "Deterministic Hypergraph Coloring and Its Applications",
journal = "Lecture Notes in Computer Science",
volume = "1518",
pages = "35--??",
year = "1998",
url = "citeseer.ist.psu.edu/lu98deterministic.html" }
Citations (may not include all citations):218 Probabilistic construction of deterministic algorithm: Appro.. (context) - Raghavan - 1994
163 The complexity of enumeration and reliability problems (context) - Valiant - 1979
56 An algorithmic approach to the Lov'asz local lemma (context) - Beck - 1991
54 Problems and results on 3-chromatic hypergraphs and some rel.. (context) - Erdos, Lov'asz - 1975
44 A parallel algorithmic version of the local lemma (context) - Alon - 1991
40 Approximations of general independent distributions - Even, Goldreich et al. - 1992
32 Hardness vs (context) - Nisan, Wigderson - 1988
28 Pseudo-random bits for constant depth circuits (context) - Nisan - 1991
24 New algorithmic aspects of the local lemma with applications.. - Leighton, Rao et al. - 1999
13 and its applications to integer programming (context) - Srinivasan, of et al. - 1996
10 the dimensions of ordered sets of bounded degree (context) - Furedi, Kahn - 1986
6 A deterministic approximation algorithm for a minmax integer.. - Lu - 1999
5 Deterministic approximate counting of depth-2 circuits - Luby, Velickovi'c et al. - 1993
1 On deterministic approximate counting of DNF (context) - Luby, Velickovi'c - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.umass.edu/~cjlu/paper.html): More
A Deterministic Approximation Algorithm for a Minmax Integer.. - Lu (1999) (Correct)
Improved Pseudorandom Generators for Combinatorial Rectangles - Lu (1998) (Correct)
Searching constant width mazes captures the AC0 hierarchy - Barrington, Lu, Miltersen, .. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC