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 条

[31] Large Deviations of Max-Weight Scheduling Policies on Convex Rate Regions
Subramanian, Vijay G.
MATHEMATICS OF OPERATIONS RESEARCH, 2010, 35 (04) : 881 - 910
[32] Two-Stage Stochastic Max-Weight Independent Set Problems
Li, Min
Liu, Qian
Zhou, Yang
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 203 - 213
[33] Max-Weight Revisited: Sequences of Nonconvex Optimizations Solving Convex Optimizations
Valls, Victor
Leith, Douglas J.
IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (05) : 2691 - 2704
[34] MAC Scheduling with Performance Guarantee: From Max-Weight to Random Access
Yi, Yung
ICOIN: 2009 INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING, 2009, : 489 - 541
[35] Injective Edge Coloring for Graphs with Small Edge Weight
Jian Lu
Huiqing Liu
Xiaolan Hu
Graphs and Combinatorics, 2022, 38
[36] Injective Edge Coloring for Graphs with Small Edge Weight
Lu, Jian
Liu, Huiqing
Hu, Xiaolan
GRAPHS AND COMBINATORICS, 2022, 38 (05)
[37] Stability of the Max-Weight Routing Protocol in Dynamic Networks and and Scheduling at Critical Loads
Andrews, Matthew
Jung, Kyomin
Stolyar, Alexander
STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 145 - 154
[38] Approximation algorithms for the max-coloring problem
Pemmaraju, SV
Raman, R
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 1064 - 1075
[39] A tighter bound for counting max-weight solutions to 2SAT instances
Wahlstroem, Magnus
PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS, 2008, 5018 : 202 - 213
[40] Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
Konemann, Jochen
Parekh, Ojas
Pritchard, David
APPROXIMATION AND ONLINE ALGORITHMS, 2009, 5426 : 1 - +

← 1 2 3 4 5 →