On the max-weight edge coloring problem

被引：6
|
作者：
Lucarelli, Giorgio [1 ]
Milis, Ioannis [1 ]
Paschos, Vangelis T. [2 ,3 ]
机构：
[1] Athens Univ Econ & Business, Dept Informat, Athens 10434, Greece
[2] Univ Paris 09, F-75016 Paris, France
[3] CNRS, LAMSADE, UMR 7024, F-75016 Paris, France
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2010年 / 20卷 / 04期
关键词：
Weighted edge coloring; Polynomial algorithms; Approximation algorithms; COMPLEXITY;
D O I：
10.1007/s10878-009-9223-z
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
We study the following generalization of the classical edge coloring problem: Given a weighted graph, find a partition of its edges into matchings (colors), each one of weight equal to the maximum weight of its edges, so that the total weight of the partition is minimized. We explore the frontier between polynomial and NP-hard variants of the problem, with respect to the class of the underlying graph, as well as the approximability of NP-hard variants. In particular, we present polynomial algorithms for bounded degree trees and star of chains, as well as an approximation algorithm for bipartite graphs of maximum degree at most twelve which beats the best known approximation ratios.
引用
收藏
页码：429 / 442
页数：14
相关论文
共 50 条
  • [1] On the max-weight edge coloring problem
    Giorgio Lucarelli
    Ioannis Milis
    Vangelis T. Paschos
    Journal of Combinatorial Optimization, 2010, 20 : 429 - 442
  • [2] Approximating the max-edge-coloring problem
    Bourgeois, N.
    Lucarelli, G.
    Milis, I.
    Paschos, V. Th.
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (34-36) : 3055 - 3067
  • [3] Approximating the Max Edge-Coloring Problem
    Bourgeois, Nicolas
    Lucarelli, Giorgio
    Milis, Ioannis
    Paschos, Vangelis Th.
    COMBINATORIAL ALGORITHMS, 2009, 5874 : 83 - +
  • [4] Learning max-weight discriminative forests
    Tan, Vincent Y. F.
    Fisher, John W., III
    Willsky, Alan S.
    2008 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING, VOLS 1-12, 2008, : 1877 - 1880
  • [5] The min-max edge q-coloring problem
    Larjomaa, Tommi
    Popa, Alexandru
    Journal of Graph Algorithms and Applications, 2015, 19 (01) : 505 - 528
  • [6] Improved Approximation Algorithms for the Max-Edge Coloring Problem
    Lucarelli, Giorgio
    Milis, Ioannis
    THEORY AND PRACTICE OF ALGORITHMS IN COMPUTER SYSTEMS, 2011, 6595 : 206 - +
  • [7] Improved approximation algorithms for the Max Edge-Coloring problem
    Lucarelli, Giorgio
    Milis, Ioannis
    INFORMATION PROCESSING LETTERS, 2011, 111 (16) : 819 - 823
  • [8] The Min-max Edge q-Coloring Problem
    Larjomaa, Tommi
    Popa, Alexandru
    COMBINATORIAL ALGORITHMS, IWOCA 2014, 2015, 8986 : 226 - 237
  • [9] On the complexity of the max-edge-coloring problem with its variants
    Yu, Chang Wu
    COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES, 2007, 4614 : 350 - 361
  • [10] Max-weight scheduling across multiple timescales
    Squillante, Mark S.
    van de Ven, Peter M.
    OPERATIONS RESEARCH LETTERS, 2018, 46 (02) : 245 - 250
12345