Search results for "Weighted coloring"

Found 14 publication records. Showing 14 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos	Weighted Coloring: Further Complexity and Approximability Results.	ICTCS	2005	DBLP DOI BibTeX RDF	weighted coloring, line graph of bipartite graphs, Approximation algorithm, NP-complete problems, interval graphs, partial k-tree
2	Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos	Time slot scheduling of compatible jobs.	J. Scheduling	2007	DBLP DOI BibTeX RDF	Weighted coloring, Chromatic scheduling, Approximations, Edge coloring, Batch scheduling
1	Dominique de Werra, Marc Demange, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos	Weighted coloring on planar, bipartite and split graphs: Complexity and approximation.	Discrete Applied Mathematics	2009	DBLP DOI BibTeX RDF
1	Uriel Feige, Mohit Singh	Edge Coloring and Decompositions of Weighted Graphs.	ESA	2008	DBLP DOI BibTeX RDF
1	Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos	Weighted Coloring: further complexity and approximability results.	Inf. Process. Lett.	2006	DBLP DOI BibTeX RDF
1	Arunesh Mishra, Suman Banerjee, William A. Arbaugh	Weighted coloring based channel assignment for WLANs.	Mobile Computing and Communications Review	2005	DBLP DOI BibTeX RDF
1	Xueliang Li, Wenan Zang	A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs.	J. Comb. Optim.	2005	DBLP DOI BibTeX RDF	algorithm, complexity, graph coloring, network flow, perfect graph
1	Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier	Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation.	ISAAC	2004	DBLP DOI BibTeX RDF
1	Marc Demange, Dominique de Werra, Jérôme Monnot, Vangelis Th. Paschos	Weighted Node Coloring: When Stable Sets Are Expensive.	WG	2002	DBLP DOI BibTeX RDF
1	Massimiliano Caramia, Paolo Dell'Olmo	Solving the minimum-weighted coloring problem.	Networks	2001	DBLP DOI BibTeX RDF
1	Xiao Zhou, Takao Nishizeki	Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs.	ISAAC	2001	DBLP DOI BibTeX RDF
1	Colin McDiarmid, Bruce A. Reed	Channel assignment and weighted coloring.	Networks	2000	DBLP DOI BibTeX RDF
1	Egon Balas, Jue Xue	Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs.	SIAM J. Comput.	1992	DBLP DOI BibTeX RDF
1	Egon Balas, Jue Xue	Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs.	SIAM J. Comput.	1991	DBLP DOI BibTeX RDF