Optimal edgecoloring with edge rate constraints
Dereniowski, Dariusz; Kubiak, W.; Ries, Bernard; Zwols, Yori (2013), Optimal edgecoloring with edge rate constraints, Networks, 62, 3, p. 165182. 10.1002/net.21505
Type
Article accepté pour publication ou publiéDate
2013Journal name
NetworksVolume
62Number
3Publisher
Wiley
Pages
165182
Publication identifier
Metadata
Show full item recordAuthor(s)
Dereniowski, DariuszKubiak, W.
Ries, Bernard
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Zwols, Yori
Abstract (EN)
We consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable. Therefore, as is commonly done [Golumbic, Algorithmic graph theory and perfect graphs, 2004], we restrict our investigation to a special class of graphs. In recent work [Birand et al., INFOCOM 2010 Proceedings, 2010], two of the authors dealt with socalled OLoP (Overall Local Pooling) graphs, a class of graphs for which similar matchingrelated problems are tractable (namely, in an online distributed wireless network scheduling setting). We therefore focus on these graphs and generalize the results to a larger class of graphs which we call GOLoP graphs. In particular, we show that deciding whether a given GOLoP graph has a matching sequence of length at most k can be done in linear time. In case the answer is affirmative, we show how to construct, in quadratic time, the matching sequence of length at most k. Finally, we prove that, for GOLoP graphs, the length of a shortest sequence does not exceed a constant times the least common denominator of the fractions r(e), leading to a pseudopolynomialtime algorithm for minimizing the length of the sequence. We show that the constant equals 1 for OLoP graphs and, following Seymour [Seymour, Proc. London Math. Soc., 1979], conjecture that the constant is as small as 2 for general graphs. We then show that this conjecture holds for all graphs with at most 10 vertices.Subjects / Keywords
edge coloring; fractional edge coloring; nearly bipartite graphs; scheduling algorithms; throughput maximization; greedy maximal scheduling; wireless networksRelated items
Showing items related by title and author.

Zwols, Yori; Ries, Bernard; Chudnovsky, Maria (2011) Article accepté pour publication ou publié

Ries, Bernard; Chudnovsky, Maria; Zwols, Yori (2011) Article accepté pour publication ou publié

Birand, Berk; Chudnovsky, Maria; Ries, Bernard; Seymour, Paul; Zussman, Gil; Zwols, Yori (2012) Article accepté pour publication ou publié

Zussman, Gil; Seymour, Paul; Zwols, Yori; Birand, Berk; Ries, Bernard; Chudnovsky, Maria (2010) Communication / Conférence

Ries, Bernard; Picouleau, Christophe; de Werra, Dominique; Costa, MarieChristine (2009) Article accepté pour publication ou publié