Expected complexity of graph partitioning problems
Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
Coloring random and semi-random k-colorable graphs
Journal of Algorithms
Algorithmic theory of random graphs
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Approximate graph coloring by semidefinite programming
Journal of the ACM (JACM)
Approximating the independence number via the j -function
Mathematical Programming: Series A and B
Finding a large hidden clique in a random graph
proceedings of the eighth international conference on Random structures and algorithms
Finding and certifying a large hidden clique in a semirandom graph
Random Structures & Algorithms
Heuristics for semirandom graph problems
Journal of Computer and System Sciences
Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Colouring Random Graphs in Expected Polynomial Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Finding Sparse Induced Subgraphs of Semirandom Graphs
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Colouring Random Graphs in Expected Polynomial Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The Lovász Number of Random Graphs
Combinatorics, Probability and Computing
Solving random satisfiable 3CNF formulas in expected polynomial time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Finding a maximum independent set in a sparse random graph
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
| Hi-index | 0.00 |
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. First, let Gn,p be a random graph, and let S be a set consisting of k vertices, chosen uniformly at random. Then, let G0 be the graph obtained by deleting all edges connecting two vertices in S. Adding to G0 further edges that do not connect two vertices in S, an adversary completes the instance G = G*n,p,k. We propose an algorithm that in the case k 驴 C(n/p)1/2 on input G within polynomial expected time finds an independent set of size 驴 k.