Polynomial time approximation schemes for dense instances of minimum constraint satisfaction release_nycnpgnlczbzxniyg4jgrhu2ni

by Cristina Bazgan, W. Fernandez de la Vega, Marek Karpinski

Published in Random structures & algorithms (Print) by Wiley.

2003   Volume 23, p73-91

Archived Files and Locations

application/pdf  378.7 kB
file_bt5tox4b7bddnip2lzdnqwowha
hal.archives-ouvertes.fr (repository)
web.archive.org (webarchive)
application/pdf  211.5 kB
file_7ztmzn3m6nhtxhk3o35njhyiiy
web.archive.org (webarchive)
l1.lamsade.dauphine.fr (web)
web.archive.org (webarchive)
www.lamsade.dauphine.fr (web)
web.archive.org (webarchive)
+ 2 more URLs
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2003-06-18
Language   en ?
Container Metadata
Not in DOAJ
In Keepers Registry
ISSN-L:  1042-9832
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: b8fcfadb-adc5-4ffb-b157-02433592d957
API URL: JSON