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 条
  • [21] Many-Sources Large Deviations for Max-Weight Scheduling
    Subramanian, Vijay G.
    Javidi, Tara
    Kittipiyakul, Somsak
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) : 2151 - 2168
  • [22] Max-Weight Scheduling in Queueing Networks With Heavy-Tailed Traffic
    Markakis, Mihalis G.
    Modiano, Eytan
    Tsitsiklis, John N.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2014, 22 (01) : 257 - 270
  • [23] Augmenting Max-Weight with Explicit Learning for Wireless Scheduling with Switching Costs
    Krishnasamy, Subhashini
    Akhil, P. T.
    Arapostathis, Ari
    Shakkottai, Sanjay
    Sundaresan, Rajesh
    IEEE INFOCOM 2017 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, 2017,
  • [24] Beyond Max-weight Scheduling: A Reinforcement Learning-based Approach
    Bae, Jeongmin
    Lee, Joohyun
    Chong, Song
    17TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS (WIOPT 2019), 2019, : 92 - 99
  • [25] Augmenting Max-Weight With Explicit Learning for Wireless Scheduling With Switching Costs
    Krishnasamy, Subhashini
    Akhil, P. T.
    Arapostathis, Ari
    Sundaresan, Rajesh
    Shakkottai, Sanjay
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (06) : 2501 - 2514
  • [26] On the Maximum Edge Coloring Problem
    Lucarelli, Giorgio
    Milis, Ioannis
    Paschos, Vangelis Th.
    APPROXIMATION AND ONLINE ALGORITHMS, 2009, 5426 : 279 - +
  • [27] EDGE-COLORING PROBLEM
    BIGGS, N
    AMERICAN MATHEMATICAL MONTHLY, 1972, 79 (09): : 1018 - &
  • [28] Large Deviations Of Max-Weight Scheduling Policies On Convex Rate Regions
    Subramanian, Vijay G.
    2008 INFORMATION THEORY AND APPLICATIONS WORKSHOP, 2008, : 452 - 461
  • [29] Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities
    Papadimitriou, Christos
    Pollner, Tristan
    Saberi, Amin
    Wajc, David
    MATHEMATICS OF OPERATIONS RESEARCH, 2024, 49 (03) : 1607 - 1628
  • [30] Variable Frame Based Max-Weight Algorithms for Networks with Switchover Delay
    Celik, G.
    Borst, S.
    Whiting, P.
    Modiano, E.
    2011 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2011,
12345