We study the following variant of the Max k-Cut problem. Given an input graph G with positively weighted edges and k colors, we wish to compute a subgraph H of G containing "lots" of heavy edges and a color assignment c : V ! [k] such that: (a) all edges in H are properly colored and (b) a "large fraction" of edges in G n H is properly colored. We give several definitions of "lots" and "large fraction" and give fast polynomial time algorithms to compute such color assignments. This problem is related to the frequency allocation problems for cellular telephone networks but could be useful in other scenarios too. Key words: Algorithms; Approximation; Max k-Cut; Spanning subgraphs; Induced subgraphs 1 ...
Abstract: We study the maximization version of the fundamental graph coloring problem. Here the goal...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
AbstractWe propose a polynomial time approximation algorithm for a novel maximum edge coloring probl...
Abstract We study the following variant of the Max kCut problem Given an input graph G with positiv...
. We study the Max k-Cut problem and its dual, the Min k-Partition problem. In the Min k-Partition p...
We study the following variant of the Max k-Cut problem. Given an input graph G with positively weig...
For a given graph, the Maximum k-Colorable Subgraph Problem is the problem of determining the larges...
We propose polynomial time approximation algorithms for a novel maximum edge coloring problem which ...
The Max-Cut problem is a well known combinatorial optimization problem. In this paper we describe a ...
AbstractThe max-edge-coloring problem is a natural weighted generalization of the classical edge-col...
The max edge-coloring problem is a natural weighted generalization of the classical edge-coloring pr...
The Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, ea...
Network models allow one to deal with massive data sets using some standard concepts from graph theo...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
The problem of colouring a k-colourable graph is well-known to be NP-complete, for k ≥ 3. The MAX-k-...
Abstract: We study the maximization version of the fundamental graph coloring problem. Here the goal...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
AbstractWe propose a polynomial time approximation algorithm for a novel maximum edge coloring probl...
Abstract We study the following variant of the Max kCut problem Given an input graph G with positiv...
. We study the Max k-Cut problem and its dual, the Min k-Partition problem. In the Min k-Partition p...
We study the following variant of the Max k-Cut problem. Given an input graph G with positively weig...
For a given graph, the Maximum k-Colorable Subgraph Problem is the problem of determining the larges...
We propose polynomial time approximation algorithms for a novel maximum edge coloring problem which ...
The Max-Cut problem is a well known combinatorial optimization problem. In this paper we describe a ...
AbstractThe max-edge-coloring problem is a natural weighted generalization of the classical edge-col...
The max edge-coloring problem is a natural weighted generalization of the classical edge-coloring pr...
The Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, ea...
Network models allow one to deal with massive data sets using some standard concepts from graph theo...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
The problem of colouring a k-colourable graph is well-known to be NP-complete, for k ≥ 3. The MAX-k-...
Abstract: We study the maximization version of the fundamental graph coloring problem. Here the goal...
We study the following generalization of the classical edge coloring problem: Given a weighted graph...
AbstractWe propose a polynomial time approximation algorithm for a novel maximum edge coloring probl...