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
关键词
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 条
  • [41] Remarks on an Edge-coloring Problem
    Hoppen, Carlos
    Lefmann, Hanno
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2019, 346 : 511 - 521
  • [42] A Coloring Solution to the Edge Crossing Problem
    Jianu, Radu
    Rusu, Adrian
    Fabian, Andrew J.
    Laidlaw, David H.
    INFORMATION VISUALIZATION, IV 2009, PROCEEDINGS, 2009, : 691 - +
  • [43] An edge coloring problem for graph products
    Faudree, RJ
    Gyarfas, A
    Schelp, RH
    JOURNAL OF GRAPH THEORY, 1996, 23 (03) : 297 - 302
  • [44] The strong edge-coloring for graphs with small edge weight
    Chen, Lily
    Huang, Mingfang
    Yu, Gexin
    Zhou, Xiangqian
    DISCRETE MATHEMATICS, 2020, 343 (04)
  • [45] Integration of Multi-Path Optimized Link State Protocol with Max-Weight Scheduling
    Szwabe, Andrzej
    Misiorek, Pawel
    2009 INTERNATIONAL CONFERENCE ON INFORMATION AND MULTIMEDIA TECHNOLOGY, PROCEEDINGS, 2009, : 458 - 462
  • [46] Max-Weight Algorithm for Mobile Data Offloading through Wi-Fi Networks
    Lin, Shirong
    Li, Zhijun
    Jiang, Shouxu
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2014, 2014, 8491 : 773 - 782
  • [47] Approximation algorithms for maximum edge coloring problem
    Feng, Wangsen
    Zhang, Li'ang
    Qu, Wanling
    Wang, Hanpin
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, 4484 : 646 - +
  • [48] On the construction of new bent functions from the max-weight and min-weight functions of old bent functions
    Climent J.-J.
    García F.J.
    Requena V.
    SeMA Journal, 2015, 72 (1) : 13 - 36
  • [49] A Novel Distributed Max-Weight Link Scheduler for Multi-Transmit/Receive Wireless Mesh Networks
    Xu, Yuanhuizi
    Chin, Kwan-Wu
    Raad, Raad
    Soh, Sieteng
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2016, 65 (11) : 9345 - 9357
  • [50] Queue Length Asymptotics for Generalized Max-Weight Scheduling in the presence of Heavy-Tailed Traffic
    Jagannathan, Krishna
    Markakis, Mihalis
    Modiano, Eytan
    Tsitsiklis, John N.
    2011 PROCEEDINGS IEEE INFOCOM, 2011, : 2318 - 2326