Optimal edge-coloring with edge rate constraints
type: Item
instance of: scholarly article
title: Optimal edge-coloring with edge rate constraints
zbMATH Open document ID: 1338.05079
author: Dariusz Dereniowski
author: Bernard Ries
author: Yori Zwols
author: Wieslaw Kubiak
published in: Networks
publication date: 2016-06-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6591789
zbMATH Keywords: edge coloring
zbMATH Keywords: fractional edge colorin
zbMATH Keywords: nearly bipartite graphs
zbMATH Keywords: scheduling algorithms
zbMATH Keywords: throughput maximization
zbMATH Keywords: greedy maximal scheduling
zbMATH Keywords: wireless networks
MaRDI profile type: MaRDI publication profile
full work available at URL: net.21505
OpenAlex ID: W2075240586
cites work: Q4258216
cites work: Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: The chromatic index of nearly bipartite multigraphs
cites work: Algorithms - ESA 2003
cites work: Q4198056
cites work: Algorithmic graph theory and perfect graphs
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Link scheduling in polynomial time
cites work: The NP-Completeness of Edge-Coloring
cites work: Odd Minimum Cut-Sets and b-Matchings
cites work: Q5286938
cites work: The chromatic index of multigraphs of order at most 10
cites work: On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
cites work: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
DOI: 10.1002/NET.21505
description: scientific article; zbMATH DE number 6591789