Robust Approximation of Temporal CSP
type: Item
instance of: scholarly article
zbMATH Open document ID: 1359.68144
author: Suguru Tamaki
author: Yuichi Yoshida
publication date: 2017-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 6696521
zbMATH Keywords: constraint satisfaction
zbMATH Keywords: maximum satisfiability
zbMATH Keywords: approximation algorithm
zbMATH Keywords: hardness of approximation
zbMATH Keywords: infinite domain
MaRDI profile type: Publication
full work available at URL: 30.pdf
OpenAlex ID: W2249596971
title: Robust Approximation of Temporal CSP
DOI: 10.4230/LIPICS.APPROX-RANDOM.2014.419
Recommended article: Q5094139
Recommended article: Q5750422
Recommended article: The complexity of temporal constraint satisfaction problems
Recommended article: Efficient Temporal Satisfiability
Recommended article: Q5314476
Recommended article: STCSP -- structured temporal constraint satisfaction problems
Recommended article: Tractable approximations for temporal constraint handling
Recommended article: Q3047797
description: scientific article