Optimal edge-coloring with edge rate constraints

Dariusz Dereniowski; Wiesław Kubiak; Bernard Ries; Yori Zwols

doi:10.1002/net.21505

Optimal edge-coloring with edge rate constraints

Abstrakt

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 so-called OLoP (Overall Local Pooling) graphs, a class of graphs for which similar matching-related 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 pseudopolynomial-time 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.

Cytowania

1

CrossRef
0

Web of Science
1

Scopus

Autorzy (4)

Dariusz Dereniowski prof. dr hab. inż.
Wiesław Kubiak
- Memorial University Faculty of Business Administration
Bernard Ries
- Université Paris Dauphine Department of Mathematics and Computer Science
Yori Zwols
- Concordia University Department of Computer Science and Software Engineering

Cytuj jako

Pełna treść

pełna treść publikacji nie jest dostępna w portalu

pełna treść artykułu zobacz w serwisie zewnętrznym otwiera się w nowej karcie

Słowa kluczowe

Informacje szczegółowe

Kategoria:: Publikacja w czasopiśmie
Typ:: artykuł w czasopiśmie wyróżnionym w JCR
Opublikowano w:: NETWORKS nr 63, wydanie 3, strony 165 - 182,
ISSN: 0028-3045
Język:: angielski
Rok wydania:: 2013
Opis bibliograficzny:: Dereniowski D., Kubiak W., Ries B., Zwols Y.: Optimal edge-coloring with edge rate constraints// NETWORKS. -Vol. 63, iss. 3 (2013), s.165-182
DOI:: Cyfrowy identyfikator dokumentu elektronicznego (otwiera się w nowej karcie) 10.1002/net.21505
Weryfikacja:: Politechnika Gdańska