Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

88

Voted

FCT
1999
Springer

93views Applied Computing» more FCT 1999»

A Polynomial Time Approximation Scheme for Dense MIN 2SAT

15 years 7 months ago

A Polynomial Time Approximation Scheme for Dense MIN 2SAT

Download www.lamsade.dauphine.fr

Abstract. It is proved that everywhere-dense Min 2SAT and everywheredense Min Eq both have polynomial time approximation schemes.

Cristina Bazgan, Wenceslas Fernandez de la Vega

Real-time Traffic

Applied Computing | FCT 1999 | Min Eq | Polynomial Time Approximation |

claim paper

Related Content

» Approximating MinMax Regret Versions of Some Polynomial Problems

» Polynomial time approximation schemes for dense instances of NPhard problems

» An Approximate MaxSteinerTreePacking MinSteinerCut Theorem

» Free Bits PCPs and NonApproximability Towards Tight Results

» Weighted Coloring on Planar Bipartite and Split Graphs Complexity and Improved Approximati...

» New results on optimizing rooted triplets consistency

» Unbalanced Graph Cuts

» Network Lifetime and Power Assignment in ad hoc Wireless Networks

» GIST GroupIndependent Spanning Tree for Data Aggregation in Dense Sensor Networks

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	FCT
Authors	Cristina Bazgan, Wenceslas Fernandez de la Vega

Comments (0)