On two restricted ancestors tree problems

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

Citing 4
Cited 0

Minimum perfect bipartite matchings and spanning trees under categorization

Discrete Applied Mathematics
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
The complexity of bottleneck labeled graph problems

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science

Quantified Score

Hi-index	0.90

Visualization

Abstract

We consider rooted minimum spanning tree problems subject to allowed ancestor relations which follow from network security constraints. In one problem nodes are associated with security labels that impose father-child relations. We prove that the feasible solutions define a matroid. In the other problem, there are permission constraints which impose descendant-ancestor relations. We show that even simple special cases of this problem are not approximable within a sub-logarithmic factor, and describe a square root approximation when the edge weights satisfy the triangle inequality.