A fully polynomial time approximation scheme for refutations in weighted difference constraint systems (Q2636553): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: K. Subramani and Vahan Mkrtchyan / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Vahan V. Mkrtchyan / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Piotr J. Wojciechowski / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-74180-2_4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2783180493 / rank | |||
Normal rank | |||
Latest revision as of 01:33, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully polynomial time approximation scheme for refutations in weighted difference constraint systems |
scientific article |
Statements
A fully polynomial time approximation scheme for refutations in weighted difference constraint systems (English)
0 references
5 June 2018
0 references
difference constraint systems
0 references
approximation algorithms
0 references
graph theory
0 references
negative cost cycle
0 references
certification
0 references
