Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION-Reference-Cited by-同舟云学术

Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION

Published:2002 Issue: Volume: Page:623-632
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Berman Piotr,Karpinski Marek

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45465-9_53

Reference12 articles.

1. S. Arora, C. Lund, Hardness of Approximations, in Approximation Algorithms for NP-Hard Problems, D. S. Hochbaum (ed.), PWS Publishing, Boston 1995, 399–446.

2. C. Bazgan, W. Fernandez de la Vega and M. Karpinski, Approximability of dense instances of NEAREST CODEWORD problem, ECCC Tech. Report TR00-091, 2000, to appear in Proc. 8th SWAT (2002).

3. Lect Notes Comput Sci;P. Berman,1999

4. P. Berman and M. Karpinski, Approximating Minimum Unsatisfiability of Linear Equations, ECCC Technical Report, TR01-025, 2001, also in Proc. 13th ACM-SIAM SODA (2002), 514–516.

5. T. N. Bui and C. Jones, Finding Good Approximate Vertex and Edge Partitions is Hard, Inform. Process. Letters 42 (1992), 153–159.

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

1. Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems;ACM Transactions on Algorithms;2020-04-27

2. On the Complexity of Computing the k-restricted Edge-connectivity of a Graph;Graph-Theoretic Concepts in Computer Science;2016

3. Optimal Satisfiability;Paradigms of Combinatorial Optimization;2014-08-08

4. General Bibliography;Paradigms of Combinatorial Optimization;2014-08-08

5. Optimal Satisfiability;Paradigms of Combinatorial Optimization;2013-02-13