×

Found 61 Documents (Results 1–61)

Tight lower bounds for the complexity of multicoloring. (English) Zbl 1434.68186

Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 18, 14 p. (2017).
MSC:  68Q17 05C15 05C60

Algorithms for bandwidth consecutive multicolorings of graphs (extended abstract). (English) Zbl 1304.05139

Snoeyink, Jack (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2012, Beijing, China, May 14–16, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29699-4/pbk). Lecture Notes in Computer Science 7285, 117-128 (2012).
MSC:  05C85 05C15 05C78
Full Text: DOI

\(1\)-local \(7/5\)-competitive algorithm for multicoloring hexagonal graphs. (English) Zbl 1236.05198

Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24–26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 375-382 (2010).
Full Text: DOI

Local multicoloring algorithms: computing a nearly-optimal TDMA schedule in constant time. (English) Zbl 1236.68195

Albers, Susanne (ed.) et al., STACS 2009. 26th international symposium on theoretical aspects of computer science, Freiburg, Germany, February 26–28, 2009. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-09-5). LIPIcs – Leibniz International Proceedings in Informatics 3, 613-624, electronic only (2009).

On a non-cooperative model for wavelength assignment in multifiber optical networks. (English) Zbl 1183.90084

Hong, Seok-Hee (ed.) et al., Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92181-3/pbk). Lecture Notes in Computer Science 5369, 159-170 (2008).
MSC:  90B18 91A10 91A80
Full Text: DOI

A 1-local 13/9-competitive algorithm for multicoloring hexagonal graphs. (English) Zbl 1176.68236

Lin, Guohui (ed.), Computing and combinatorics. 13th annual international conference, COCOON 2007, Banff, Canada, July 16–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73544-1/pbk). Lecture Notes in Computer Science 4598, 526-536 (2007).
Full Text: DOI

Frequency assignment and multicoloring powers of square and triangular meshes. (English) Zbl 1121.90311

Nikoletseas, Sotiris E. (ed.), Experimental and efficient algorithms. 4th international workshop, WEA 2005, Santorini Island, Greece, May 10–13, 2005. Proceedings. Berlin Springer (ISBN 3-540-25920-1/pbk). Lecture Notes in Computer Science 3503, 165-176 (2005).
Full Text: DOI

Multicoloring planar graphs and partial \(k\)-trees. (English) Zbl 0945.05027

Hochbaum, Dorit (ed.) et al., Randomization, approximation, and combinatorial optimization. Algorithms and techniques. 3rd international workshop on randomization and approximation techniques in computer science, and 2nd international workshop on approximation algorithms for combinatorial optimization problems RANDOM-APPROX ’99. Berkeley, CA, USA, August 8-11, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1671, 73-84 (1999).
MSC:  05C15

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software