Clique partitioning with value-monotone submodular cost (Q2339847): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57399730, #quickstatements; #temporary_batch_1709550817224
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2014.11.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027077687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restrictions of graph partition problems. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling with interval graphs or related classes. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual exclusion scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mutual exclusion scheduling problem for permutation and comparability graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded vertex colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Max-colorings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch processing with interval graph compatibilities between tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on a batch processing machine with split compatibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated max -Batching with Interval Graph Compatibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of graph decomposition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the decomposition of graphs into isomorphic matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time slot scheduling of compatible jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted coloring: further complexity and approximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the probabilistic minimum coloring and minimum \(k\)-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic graph-coloring in bipartite and split graphs / 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: A min-max relation for the partial q-colourings of a graph. II: Box perfection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Source coding and graph entropies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum entropy combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique partitioning of interval graphs with submodular costs on the cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Max Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Clustering Yields a PTAS for max-Coloring Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted coloring on planar, bipartite and split graphs: Complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial auctions with decreasing marginal utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Joint Replenishment Problem with General Joint Cost Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The facility location problem with general cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-error information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum entropy coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Comparability Graphs and of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique-separator graph for chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank

Latest revision as of 22:17, 9 July 2024

scientific article
Language Label Description Also known as
English
Clique partitioning with value-monotone submodular cost
scientific article

    Statements

    Clique partitioning with value-monotone submodular cost (English)
    0 references
    0 references
    0 references
    9 April 2015
    0 references
    partition into cliques
    0 references
    cost coloring
    0 references
    submodular functions
    0 references
    cardinality constraint
    0 references
    max-coloring
    0 references
    batch-scheduling with compatibilities
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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