New Results on the Complexity of the Max- and Min-Rep Problems
From MaRDI portal
Publication:3075522
DOI10.1007/978-3-642-18381-2_20zbMath1298.68112OpenAlexW1602674403MaRDI QIDQ3075522
Publication date: 15 February 2011
Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18381-2_20
Cites Work
- Unnamed Item
- Power optimization for connectivity problems
- Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- Approximating clique-width and branch-width
- Easy problems for tree-decomposable graphs
- Stochastic Steiner Tree with Non-uniform Inflation
- Improved Approximation Algorithms for Label Cover Problems
- Hardness of Approximation for Vertex-Connectivity Network Design Problems
- Transitive-Closure Spanners
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Approximation Algorithms and Hardness for Domination with Propagation
- On the hardness of approximating spanners
This page was built for publication: New Results on the Complexity of the Max- and Min-Rep Problems