On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph

Authors:
Nili Guttmann-Beck;Refael Hassin
Affiliations:
Department of Computer Science, The Academic College of Tel-Aviv Yaffo, Tel-Aviv, Israel;Department of Statistics and Operations Research, Tel-Aviv University, Tel-Aviv 69978, Israel
Venue:
Discrete Optimization
Year:
2011

Citing 11
Cited 0

A heuristic for the p-center problem in graphs

Discrete Applied Mathematics
The network inhibition problem

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improving minimum cost spanning trees by upgrading nodes

Journal of Algorithms
Increasing the weight of minimum spanning trees

Journal of Algorithms
Oriented graph coloring

Discrete Mathematics
Finding the most vital node of a shortest path

Theoretical Computer Science - Computing and combinatorics
Upgrading arcs to minimize the maximum travel time in a network

Networks
Matching interdiction

Discrete Applied Mathematics
Augmenting forests to meet odd diameter requirements

Discrete Optimization
On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems

Operations Research Letters
A simple heuristic for the p-centre problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define closed edge colorings of directed graphs, and state a conjecture about the maximum size of a tournament graph that can be arc-colored with m colors and contain no closed subgraphs. We prove special cases of this conjecture. We show that if this conjecture is correct then for any (undirected) graph with positive edge lengths and a given subset V^' of nodes, covering all the shortest paths between pairs of nodes of V^' requires at least |V^'|-1 edges. We use the latter property to produce an approximation algorithm with improved bound for minimizing the diameter or the radius of an unweighted graph by adding to it a given number of new edges.