BibTeX
CSL-JSON
MLA
Harvard
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
release_nycnpgnlczbzxniyg4jgrhu2ni
by
Cristina Bazgan, W. Fernandez de la Vega, Marek Karpinski
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
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links
oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar