On strong NP-completeness of rational problems
From MaRDI portal
Publication:1625182
DOI10.1007/978-3-319-90530-3_26zbMath1484.68074arXiv1802.09465OpenAlexW2963923155MaRDI QIDQ1625182
Publication date: 28 November 2018
Full work available at URL: https://arxiv.org/abs/1802.09465
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (4)
Positive planar satisfiability problems under 3-connectivity constraints ⋮ Coordination Games on Weighted Directed Graphs ⋮ Approximating single- and multi-objective nonlinear sum and product knapsack problems ⋮ NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times
This page was built for publication: On strong NP-completeness of rational problems
