In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-...
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...