Clique partitioning with value-monotone submodular cost
DOI10.1016/J.DISOPT.2014.11.001zbMATH Open1308.90187DBLPjournals/disopt/CorreaM15OpenAlexW2027077687WikidataQ57399730 ScholiaQ57399730MaRDI QIDQ2339847FDOQ2339847
Publication date: 9 April 2015
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2014.11.001
submodular functionscardinality constraintpartition into cliquescost coloringmax-coloringbatch-scheduling with compatibilities
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on two problems in connexion with graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Zero-error information theory
- A Characterization of Comparability Graphs and of Interval Graphs
- Combinatorial auctions with decreasing marginal utilities
- The facility location problem with general cost functions
- Approximation schemes for covering and packing problems in image processing and VLSI
- The clique-separator graph for chordal graphs
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- A note on the decomposition of graphs into isomorphic matchings
- The Joint Replenishment Problem with General Joint Cost Structures
- Mutual exclusion scheduling
- Batch processing with interval graph compatibilities between tasks
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
- Weighted coloring: further complexity and approximability results
- Clique partitioning of interval graphs with submodular costs on the cliques
- Bounded Max-colorings of Graphs
- On the Max Coloring Problem
- Automata, Languages and Programming
- Time slot scheduling of compatible jobs
- Source coding and graph entropies
- NP-completeness of graph decomposition problems
- Restrictions of graph partition problems. I
- Bounded vertex colorings of graphs
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
- Minimum entropy coloring
- Minimum entropy combinatorial optimization problems
- Minimax relations for the partial q-colorings of a graph
- On the probabilistic minimum coloring and minimum \(k\)-coloring
- Probabilistic graph-coloring in bipartite and split graphs
- A min-max relation for the partial q-colourings of a graph. II: Box perfection
- Scheduling on a batch processing machine with split compatibility graphs
- Capacitated max -Batching with Interval Graph Compatibilities
- Mutual exclusion scheduling with interval graphs or related classes. I
Cited In (2)
This page was built for publication: Clique partitioning with value-monotone submodular cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339847)
