Polynomial time approximation schemes for dense instances of minimum constraint satisfaction

Cristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski. Polynomial time approximation schemes for dense instances of minimum constraint satisfaction. Random Struct. Algorithms, 23(1):73-91, 2003. [doi]

Authors

Cristina Bazgan

This author has not been identified. Look up 'Cristina Bazgan' in Google

Wenceslas Fernandez de la Vega

This author has not been identified. Look up 'Wenceslas Fernandez de la Vega' in Google

Marek Karpinski

This author has not been identified. Look up 'Marek Karpinski' in Google