scientific article; zbMATH DE number 7051292
From MaRDI portal
Publication:4633936
zbMath1421.68216MaRDI QIDQ4633936
Rajiv Raman, Saurabh Ray, Khaled M. Elbassioni, R. A. Sitters
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496901
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (7)
On the approximability of the maximum interval constrained coloring problem ⋮ Complexity and approximability of parameterized MAX-CSPs ⋮ From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More ⋮ Hardness of computing width parameters based on branch decompositions over the vertex set ⋮ Hardness of computing width parameters based on branch decompositions over the vertex set ⋮ Pricing on Paths: A PTAS for the Highway Problem ⋮ On the Maximum Uniquely Restricted Matching for Bipartite Graphs
This page was built for publication:
