A fully polynomial time approximation scheme for refutations in weighted difference constraint systems (Q2636553): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| 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 | |||
Revision as of 04:34, 14 February 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
