Wang, Huijuan Pardalos, Panos M. Liu, Bin
Published in
Journal of Combinatorial Optimization

Motivated from optimal channel assignment in optical networks, the list edge (and total) coloring are studied in this paper. In a special case of planar graphs, we determined the list edge (and total) coloring number.

Chang, Yulin Ouyang, Qiancheng Wang, Guanghui
Published in
Journal of Combinatorial Optimization

A (proper) total-k-coloring ϕ:V(G)∪E(G)→{1,2,…,k}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\phi :V(G)\cup E(G)\rightarrow \{1,2,\ldots ,k\}$$\end{document} is cal...

D’Emidio, Mattia Forlizzi, Luca Frigioni, Daniele Leucci, Stefano Proietti, Guido
Published in
Journal of Combinatorial Optimization

Given an n-vertex non-negatively real-weighted graph G, whose vertices are partitioned into a set of k clusters, a clustered network design problem on G consists of solving a given network design optimization problem on G, subject to some additional constraints on its clusters. In particular, we focus on the classic problem of designing a single-so...

Chen, Yong Goebel, Randy Lin, Guohui Su, Bing Xu, Yao Zhang, An
Published in
Journal of Combinatorial Optimization

Given a graph G=(V,E)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G = (V, E)$$\end{document}, we seek for a collection of vertex disjoint paths each of order at most...

Gourvès, Laurent
Published in
Journal of Combinatorial Optimization

This article deals with the challenge of reaching an agreement for a group of agents who have heterogeneous preferences over a set of goods. In a recent work, Suksompong (in: Subbarao (ed) Proceedings of the twenty-fifth international joint conference on artificial intelligence, IJCAI 2016, New York, pp 489–495, 2016) models a problem of this kind ...

Peterin, Iztok Yero, Ismael G.
Published in
Journal of Combinatorial Optimization

A digraph D is an efficient closed domination digraph if there exists a subset S of V(D) for which the closed out-neighborhoods centered in vertices of S form a partition of V(D). In this work we deal with efficient closed domination digraphs among several product of digraphs. We completely describe the efficient closed domination digraphs among le...

Altner, Douglas S. Mason, Erica K. Servi, Les D.
Published in
Journal of Combinatorial Optimization

Motivated by a cybersecurity application, this paper studies a two-stage, stochastic days-off scheduling problem with (1) many types of jobs that require specialized training, (2) many multi-skilled analysts, (3) the ability to shape analyst skill sets through training decisions, and (4) a large number of possible future demand scenarios. We provid...

Bayón, L. Fortuny, P. Grau, J. Oller-Marcén, A. M. Ruiz, M. M.
Published in
Journal of Combinatorial Optimization

In this paper we consider two variants of the Secretary problem: The Best-or-Worst and the Postdoc problems. We extend previous work by considering that the number of objects is not known and follows either a discrete Uniform distribution U[1,n]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage...

Fujishige, Satoru Mahjoub, A. Ridha Rendl, Franz
Published in
Journal of Combinatorial Optimization

Szeszlér, Dávid
Published in
Journal of Combinatorial Optimization

Applying game-theoretical tools for measuring the reliability of a network has become very common. The basic idea is very natural: analyzing an appropriately defined attacker–defender game might give rise to a relevant security metric. In this paper we consider a very natural set of games: the Defender chooses a path P between two given nodes and t...