The following publications are possibly variants of this publication:
- Polynomial time approximation schemes for dense instances of minimum constraint satisfactionCristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski. rsa, 23(1):73-91, 2003. [doi]
- Polynomial time approximation schemes for dense instances of ::::NP::::-hard problemsSanjeev Arora, David R. Karger, Marek Karpinski. stoc 1995: 284-293 [doi]
- Polynomial Time Approximation Schemes for Dense Instances of NP-Hard ProblemsSanjeev Arora, David R. Karger, Marek Karpinski. jcss, 58(1):193-210, 1999.
- Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization ProblemsMarek Karpinski. algorithmica, 30(3):386-397, 2001. [doi]
- Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization ProblemsMarek Karpinski. eccc, 4(24), 1997. [doi]
- A Polynomial Time Approximation Scheme for Dense MIN 2SATCristina Bazgan, Wenceslas Fernandez de la Vega. fct 1999: 91-99 [doi]
- Polynomial time approximation of dense weighted instances of MAX-CUTWenceslas Fernandez de la Vega, Marek Karpinski. rsa, 16(4):314-332, 2000.
- Polynomial Time Approximation of Dense Weighted Instances of MAX-CUTWenceslas Fernandez de la Vega, Marek Karpinski. eccc, 5(64), 1998. [doi]