On the approximability of the minimum rainbow subgraph problem and other related problems
From MaRDI portal
(Redirected from Publication:1679237)
Recommendations
- On the approximability of the minimum rainbow subgraph problem and other related problems
- Improved approximation bounds for the minimum rainbow subgraph problem
- Approximation algorithms for the minimum rainbow subgraph problem
- Algorithmic approaches for the minimum rainbow subgraph problem
- On the minimum rainbow subgraph number of a graph
Cites work
- scientific article; zbMATH DE number 434896 (Why is no real title available?)
- scientific article; zbMATH DE number 5764908 (Why is no real title available?)
- scientific article; zbMATH DE number 1445322 (Why is no real title available?)
- A threshold of ln n for approximating set cover
- Approximating the rainbow -- better lower and upper bounds
- Approximation Algorithms and Hardness for Domination with Propagation
- Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
- Approximation algorithms for the minimum rainbow subgraph problem
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Improved approximation algorithms for label cover problems
- Improved approximation bounds for the minimum rainbow subgraph problem
- On restricted colourings of \(K_ n\)
- On the hardness of approximating spanners
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Polynomial integrality gaps for strong SDP relaxations of densest \(k\)-subgraph
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Rainbow subgraphs in properly edge‐colored graphs
- Relations between average case complexity and approximation complexity
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
- The dense \(k\)-subgraph problem
- The parameterized complexity of the rainbow subgraph problem
Cited in
(6)- On the approximability of the minimum rainbow subgraph problem and other related problems
- Improved approximation bounds for the minimum rainbow subgraph problem
- On the minimum rainbow subgraph number of a graph
- Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping
- Sum-of-squares lower bounds for densest \(k\)-subgraph
- Revisiting a randomized algorithm for the minimum rainbow subgraph problem
This page was built for publication: On the approximability of the minimum rainbow subgraph problem and other related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679237)
