On the 1.1 edge-coloring of multigraphs
SIAM Journal on Discrete Mathematics
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Asymptotics of the chromatic index for multigraphs
Journal of Combinatorial Theory Series B
Improving a family of approximation algorithms to edge color multigraphs
Information Processing Letters
On-line Edge-Coloring with a Fixed Number of Colors
On-line Edge-Coloring with a Fixed Number of Colors
An asymptotic approximation scheme for multigraph edge coloring
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
(p, k)-coloring problems in line graphs
Theoretical Computer Science
An asymptotic approximation scheme for multigraph edge coloring
ACM Transactions on Algorithms (TALG)
An improved approximation algorithm for maximum edge 2-coloring in simple graphs
Journal of Discrete Algorithms
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Approximation algorithm for maximum edge coloring
Theoretical Computer Science
Approximating maximum edge 2-coloring in simple graphs via local improvement
Theoretical Computer Science
Approximating the maximum 2- and 3-edge-colorable subgraph problems
Discrete Applied Mathematics
Approximation algorithms for maximum edge coloring problem
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Approximating maximum edge 2-coloring in simple graphs
Discrete Applied Mathematics
Approximating maximum edge 2-coloring in simple graphs
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Fast edge colorings with fixed number of colors to minimize imbalance
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Fault tolerant guarding of grids
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Approximating the maximum 3- and 4-edge-colorable subgraph
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
We study the complexity of the following problem that we call Max edge t-coloring: given a multigraph G and a parameter t, color as many edges as possible using t colors, such that no two adjacent edges are colored with the same color. (Equivalently, find the largest edge induced subgraph of G that has chromatic index at most t). We show that for every fixed t 驴 2 there is some 驴 0 such that it is NP-hard to approximate Max edge t-coloring within a ratio better than 1-驴. We design approximation algorithms for the problem with constant factor approximation ratios. An interesting feature of our algorithms is that they allow us to estimate the value of the optimum solution up to a multiplicative factor that tends to 1 as t grows. Our study was motivated by call admittance issues in satellite based telecommunication networks.