scientific article

zbMath0973.68080MaRDI QIDQ2754182

Sunil Arya, H. Ramesh, V. S. Anil Kumar

Publication date: 11 November 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (20)

Identifying Codes in Hereditary Classes of Graphs and VC-Dimension ⋮ Hypergraph representation via axis-aligned point-subspace cover ⋮ On fair covering and hitting problems ⋮ A parameterized algorithm for the hyperplane-cover problem ⋮ Removing local extrema from imprecise terrains ⋮ Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set ⋮ Approximation algorithms for a geometric set cover problem ⋮ On the approximability of covering points by lines and related problems ⋮ Bottleneck convex subsets: finding \(k\) large convex sets in a point set ⋮ Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules ⋮ Improved parameterized algorithms for minimum link-length rectilinear spanning path problem ⋮ Greedy domination on biclique-free graphs ⋮ Parameterized and approximation complexity of \textsc{Partial VC Dimension} ⋮ Geometric hitting set for segments of few orientations ⋮ On guarding the vertices of rectilinear domains ⋮ Rainbow polygons for colored point sets in the plane ⋮ Parameterized complexity of conflict-free set cover ⋮ Exact multi-covering problems with geometric sets ⋮ On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance ⋮ Approximability of guarding weak visibility polygons

This page was built for publication: