Carsten Lund
- ALON, N., GOmIIEIC, O., H&TAD, J., AND PERALTA, R. 1990. Simple constructions of almost k-wise independent random variables. In Proceedings of the 3/st lEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 543-553.Google Scholar
- ARORA, S., LUND, C., MOTWANI, R., SUD,\N, M., AND SZEGEY, M. l992. Proof verification and intractability of approximation problems. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 14-23. Google Scholar
- ARORA, S., AND SAFRA, S. 1992. Approximating clique is NP-complete. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 2: 13.Google Scholar
- BELLARE, M. 1993. Interactive proofs and approximation: Reductions from two provers in one round. In Proceedings of the 2nd Israel Symposium on Theory und Computing Systems. Springer- Verlag, Berlin, pp. 266-274.Google Scholar
- BELLARE, M., GOI.DWASSER, S., LUND, C., ANI) Russet., A. 1993. Efficient probabilistically checkable proofs and applications to approximation. In Proceedings of the 2.%/r ACM Synzpo.siunl 011 Theory of Computing (San Diego, Calif., May 16- 18). ACM, New York, pp. 294-304. Google Scholar
- BELLARE, M., AND ROGOW,\Y, P. 1993. The complexity of approximating a nonlinear program. Complexity in Numerical Optimization. P. Pardalos, Ed., World-Scientific. Singapore. pp. 16-32.Google Scholar
- BERMAN, P., AND SCHNITGER, G. 198'). On the complexity of approximating the independent set problem. In Proceedings of the 7th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 340. Springer-Verlag. New York, pp. 256-267. Google Scholar
- BLUM, A. 19YO. Some tools for approximate 3-coloring. In Proceedings of the 31.1 /E/X Symposium on Foundations of Computer Science. IEEE, New York, pp. 554-562.Google Scholar
- CHVATAL, V. 1979. A greedy heuristic for the set covering problem. Math. Op. Res. 4, 233-235.Google Scholar
- DOBSON, G. 1982. Worst-case analysis of greedy heuristics for intcgcr programming with nonnegative data. Murh. Op. Res. 7, 5 15-53 I.Google Scholar
- FEIGE, U., GOLDWASSER, S., LOV~SZ, L., SAFRA, S., AND SZEGEIIY, M. 1991. Approximating clique is almost NP-complete. In Proceedings of the 32nd IEEE Symposium on Foundutions of Computer Science. IEEE, New York, pp. 2-12. Google Scholar
- FEIGE, U., AND LovAsz, L. 1992. Two-prover one-round proof systems: Their power and their problems. In Proceedings of the 24th ACM Symposium on the Theory of Computing (Victoria, B.C., Canada, May 4-6). ACM, New York, pp. 733-744. Google Scholar
- FISHER, M. L., AND WOLSEY, L. A. 1982. On the greedy heuristic for continuous covering and packing probems. SL4M J. Aln. Disc. Meth. 3. 584-591.Google Scholar
- GAREY, k. R., AND JOHNSON, 6. S. 1976. The complexity of near-optimal graph coloring. J. ACM 23, 1 (Jan.). 43-49. Google Scholar
- GROTSCHEL, M., LbvAsz, L., AND SCHRIJVER, A. 1981. The ellipsoid method and its consequences in combinatorial optimization. Combinatorics I, 169-197.Google Scholar
- HALLDRSSON, M. M. 1990. A still better performance guarantee for approximate graph coloring. Tech. Rep. 90-44. DIMACS.Google Scholar
- JOHNSON, D. S. 1974a. Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci., 9, 256-278.Google Scholar
- JOHNSON, D. S. 1974b. Worst case behavior of graph coloring algorithms. In Proceedings of the Sfh Southeastern Conf. on Combinatorics, Graph Theory and Computing. Utilitas Mathematics Publishers, Winnipeg, Ontario, Canada.Google Scholar
- KARP, R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations. R. E. Miller and J. W. Thatcher, eds., Advances in Computing Research, Plenum Press, New York.Google Scholar
- KHANNA, S., LINIAL, N., AND SAFRA, S. 1993. On the hardness of approximating the chromatic number. In Proceedings of the 2nd Israel Symposium on Theory and Computing Systems. Springer-Verlag, New York, pp. 250-260.Google Scholar
- KOLAITIS, P. G., AND THAKUR, M. N. 1991. Approximation properties of np minimization classes. In Proceedings of the 6th Conference on Structure in Complexity Theory, pp. 353-366.Google Scholar
- Kou, L. T., STOCKMEYER, L. J., AND WONG, C. K. 1978. Covering edges by cliques with regard to keyword conflicts and intersection graphs. Commun. ACM 21, 2 (Feb.), 135-139. Google Scholar
- LAPIDOT, D., AND SI,MIR. A. 1991. Fully parallelized multiprover protocols for NEXPTIME. In f'roceedingx of the 32nd Anrzal IEEE Symposium on Foundafions of Computer Sciencr. IEEE, New York, pp. 13-18. Google Scholar
- LINIAL, N., AND VAZIKANI, U. 1989. Graph products and chromatic numbers. In Proceedings of fhe 30th fEEE Symposium on Foundations of Compter Science. IEEE, New York, pp. 124-133.Google Scholar
- LOVASZ, L. 1975. On the ratio of optimal integral and fractional covers. Disc. Muth. 13, 383-390.Google Scholar
- LUND, C., AND YANNAKKIS. M. 1993. The approximation of maximum subgraph problems. In Proceedirlgs of fhe 20th Intematiotd ColloquiLtm on Automata, Lanpages and Propmming. Springer-Vcrlag, Berlin, pp. 40-51. Google Scholar
- ORLIN, J. 1977. Contentment in graph theory: Covering graphs with cliques. In Proceedings of flze Koninklijke Nederlundse. Vol. 80 Akademie van Wetenschappen, Amsterdam, The Netherlands, pp. 406-424.Google Scholar
- PAZ, A., ANU MORAN, S. 1981. Nondeterministic polynomial optimization problems and their approximations. Theoret. Cornput. Sci. 15, 25 l-277.Google Scholar
- PAPADIMITRIOU, C., AND YANNAKAKIS, M. 1988. Optimization, approximation and complexity classes. In Proceedings of the 20th ACM Symposium on the Theory of Computing (Chicago, Ill., May 2-4). ACM, New York, pp. 229-234. Google Scholar
- SIMON, H. U. 1990. On approximate solutions for combinatorial optimization problems. SfAM J. Algebraic Discrete Methods 3, 294-310.Google Scholar
- WIGDERSON, A. 1983. Improving the performance guarantee for approximate graph coloring. 1. ACM 30, 4 (Oct.), 729-735. Google Scholar
- WOLSEY, L. A. 1982. An analysis of the greedy algorithm for the submodulat set covering problem. Comhinatorica 2, 385-393.Google Scholar
- YANNAKAKIS, M. 1979. The effect of a connectivity requirement on the complexity of maximum subgraph problems. J. ACM 26, 4 (Oct.), 618-630. Google Scholar
Index Terms
- On the hardness of approximating minimization problems
Recommendations
Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles
Parameterized and Exact AlgorithmsWe show that several problems that are hard for various parameterized complexity classes on general graphs, become fixed parameter tractable on graphs with no small cycles.
More specifically, we give fixed parameter tractable algorithms for Dominating ...
Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles
We show that several problems that are hard for various parameterized complexity classes on general graphs, become fixed parameter tractable on graphs with no small cycles.
More specifically, we give fixed parameter tractable algorithms for Dominating ...
On the parameterized complexity of approximating dominating set
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingWe study the parameterized complexity of approximating the k-Dominating Set (domset) problem where an integer k and a graph G on n vertices are given as input, and the goal is to find a dominating set of size at most F(k) · k whenever the graph G has a ...
Comments