FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5897767
DOI10.1007/11590156zbMath1172.68480OpenAlexW2484051058MaRDI QIDQ5897767
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11590156
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (10)
Improved approximation algorithms for label cover problems ⋮ Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs ⋮ The parameterized complexity of the rainbow subgraph problem ⋮ Rounding to an integral program ⋮ The minimum substring cover problem ⋮ Exact and heuristic approaches for the set cover with pairs problem ⋮ Approximation algorithms for the minimum rainbow subgraph problem ⋮ The Minimum Substring Cover Problem ⋮ New Results on the Complexity of the Max- and Min-Rep Problems ⋮ On the approximability and hardness of the minimum connected dominating set with routing cost constraint
This page was built for publication: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
