Characterizing acyclic graphs by labeling edges

Authors:
Sebastián Urrutia;Abilio Lucena
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2014

Citing 7
Cited 0

Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)
Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees

SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Determinant Factorization: A New Encoding Scheme for Spanning Trees Applied to the Probabilistic Minimum Spanning Tree Problem

Proceedings of the 6th International Conference on Genetic Algorithms
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
On teleprocessing system design: part II a method for approximating the optimal network

IBM Systems Journal
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper two new characterizations of acyclic graphs are introduced. Additionally, restricted versions of them are also proposed to address some important special cases. These restricted characterizations, in turn, were used to obtain new integer programming formulations for some associated relevant NP-hard problems. Resulting formulations are compact, in the sense that the number of variables and constraints they contain are polynomially bounded. One of them, in particular, that for the homogeneous version of the Probabilistic Minimum Spanning Tree Problem, under a MILP solver, is used here to obtain, for the first time, proven optimal solutions to that problem.