Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.05.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967845089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of finding dense subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature Article—The Ellipsoid Method: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation bounds for the minimum rainbow subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the minimum rainbow subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pure parsimony haplotyping problem: overview and computational advances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path and cycle sub-Ramsey numbers and an edge-colouring conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2857441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial case of the parsimony haplotyping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow subgraphs in properly edge‐colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted colourings of \(K_ n\) / rank
 
Normal rank

Latest revision as of 17:14, 8 July 2024

scientific article
Language Label Description Also known as
English
Better lower and upper bounds for the minimum rainbow subgraph problem
scientific article

    Statements

    Better lower and upper bounds for the minimum rainbow subgraph problem (English)
    0 references
    0 references
    7 July 2014
    0 references
    approximation algorithms
    0 references
    combinatorial problems
    0 references
    minimum rainbow subgraph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references