Paths, trees and matchings under disjunctive constraints

We study the minimum spanning tree problem, the maximum matching problem and the shortest path problem subject to binary disjunctive constraints: A negative disjunctive constraint states that a certain pair of edges cannot be contained simultaneously in a feasible solution. It is convenient to repre...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 159; no. 16; pp. 1726 - 1735
Main Authors:	Darmann, Andreas, Pferschy, Ulrich, Schauer, Joachim, Woeginger, Gerhard J.
Format:	Journal Article Conference Proceeding
Language:	English
Published:	Kidlington Elsevier B.V 28.09.2011 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Binary constraints Combinatorics Combinatorics. Ordered structures Complexity Computer science; control theory; systems Conflict graph Exact sciences and technology Graph theory Graphs Information retrieval. Graph Matching Mathematical analysis Mathematics Minimal spanning tree Sciences and techniques of general use Shortest path Shortest-path problems Theoretical computing Trees Matching Conflict graph Shortest path Minimal spanning tree Binary constraints Edge(graph) Graph path Computer theory Connected graph Optimization Complexity Maximum Spanning tree Combinatorics State constraint
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!