Minimum partition of an independence system into independent sets
type: Item
instance of: scholarly article
title: Minimum partition of an independence system into independent sets
zbMATH Open document ID: 1160.90682
author: Sanming Zhou
published in: Discrete Optimization
publication date: 2009-04-17T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5544693
zbMATH Keywords: hereditary property
zbMATH Keywords: conditional colouring
zbMATH Keywords: conditional chromatic number
zbMATH Keywords: minimum set cover problem
zbMATH Keywords: domination number
zbMATH Keywords: connected domination number
zbMATH Keywords: clique domination number
zbMATH Keywords: split graph
MaRDI profile type: Publication
full work available at URL: j.disopt.2008.10.001
OpenAlex ID: W1978182645
cites work: The subchromatic number of a graph
cites work: Boolean techniques for matroidal decomposition of independence systems and applications to graphs
cites work: Q4099676
cites work: Q3737429
cites work: Q3097395
cites work: On generalized graph colorings
cites work: Graph properties and hypergraph colourings
cites work: Domination number and neighbourhood conditions
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Q4489228
cites work: An interpolation theorem for partitions which are complete with respect to hereditary properties
cites work: On the geometric structure of independence systems
cites work: On the Facial Structure of Independence System Polyhedra
cites work: Dominating cliques in graphs
cites work: Minimum partition of a matroid into independent subsets
cites work: Augmenting Paths and a Class of Independence Systems
cites work: Q4182251
cites work: Q3139747
cites work: The greedy algorithm for partially ordered sets
cites work: Q3031924
cites work: Coloring Theories
cites work: Estimations for the domination number of a graph
cites work: On a certain class of polytopes associated with independence systems.
cites work: Q3220612
cites work: COVERING AND PACKING IN GRAPHS, I.
cites work: K-greedy algorithms for independence systems
cites work: On the Problem of a Generalization of the Hamilton-Jacobi Method for Nonholonomic Systems
cites work: Worst case analysis of greedy type algorithms for independence systems
cites work: Q4368728
cites work: Hereditary systems and greedy-type algorithms.
cites work: Q4202301
cites work: An interpolation theorem for partitions which are indivisible with respect to cohereditary properties
cites work: Approximation algorithms for combinatorial problems
cites work: Q3328285
cites work: An Analysis of the Greedy Heuristic for Independence Systems
cites work: Greedoids
cites work: Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
cites work: A generalization of antiwebs to independence systems and their canonical facets
cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
cites work: On the ratio of optimal integral and fractional covers
cites work: Closure in Independence Systems
cites work: Q4187838
cites work: Properties of vertex packing and independence system polyhedra
cites work: Q4108373
cites work: Q4398168
cites work: Q4873773
cites work: Chromatic partitions of a graph
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Q4111952
cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems
cites work: Q3035307
cites work: Interpolation theorems for graphs, hypergraphs and matroids
cites work: A sequential coloring algorithm for finite sets
DOI: 10.1016/J.DISOPT.2008.10.001
description: scientific article; zbMATH DE number 5544693