The maximum vertex coverage problem on bipartite graphs (Q2448919): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4263699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Helly edge-path-tree graphs and their clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minconvex Factors of Prescribed Size in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax relations for the partial q-colorings of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Monotone Submodular Function Subject to a Matroid Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A min-max relation for the partial q-colourings of a graph. II: Box perfection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of generalized clique covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum \(h\)-colourable subgraph problem in balanced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((p,k)\)-coloring problems in line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chain and antichain families of a partially ordered set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation of maximum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximumk-colorings andk-coverings of transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation of max-vertex-cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to Approximating Partial Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax relations for cyclically ordered digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank

Revision as of 12:21, 8 July 2024

scientific article
Language Label Description Also known as
English
The maximum vertex coverage problem on bipartite graphs
scientific article

    Statements

    The maximum vertex coverage problem on bipartite graphs (English)
    0 references
    0 references
    0 references
    5 May 2014
    0 references
    vertex cover
    0 references
    transversal number
    0 references
    matching
    0 references
    hypergraphs
    0 references
    clique covering
    0 references
    NP-hardness
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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