Approximation of min coloring by moderately exponential algorithms-Reference-Cited by-同舟云学术

Approximation of min coloring by moderately exponential algorithms

Published:2009-07 Issue:16 Volume:109 Page:950-954
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Bourgeois Nicolas,Escoffier Bruno,Paschos Vangelis Th.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference19 articles.

1. Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness;Bazgan;Theoret. Comput. Sci.,2005

2. Graphs and Hypergraphs;Berge,1973

3. A. Björklund, T. Husfeldt, Inclusion–exclusion algorithms for counting set partitions, in: Proc. FOCS'06, 2006, pp. 575–582

4. N. Bourgeois, B. Escoffier, V.Th. Paschos, Efficient approximation by “low-complexity” exponential algorithms. Cahier du LAMSADE 271, LAMSADE, Université Paris-Dauphine, December 2007. Available at http://www.lamsade.dauphine.fr/cahiers/PDF/cahierLamsade271.pdf

5. N. Bourgeois, B. Escoffier, V.Th. Paschos, Efficient approximation of combinatorial problems by moderately exponential algorithms, in: Proc. Algorithms and Data Structures Symposium, WADS'09, in: Lecture Notes in Computer Science, Springer-Verlag, 2009, in press

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. (In)approximability of maximum minimal FVS;Journal of Computer and System Sciences;2022-03

2. Time-approximation trade-offs for inapproximable problems;Journal of Computer and System Sciences;2018-03

3. Super-polynomial approximation branching algorithms;RAIRO - Operations Research;2016-10

4. Time-Approximation Trade-offs for Inapproximable Problems;LEIBNIZ INT PR INFOR;2016

5. Approximating MAX SAT by moderately exponential and parameterized algorithms;Theoretical Computer Science;2014-12