Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The hardness of approximate optima in lattices, codes, and systems of linear equations
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
SIAM Journal on Computing
Bioinformatics
Cell segmentation, tracking, and mitosis detection using temporal context
MICCAI'05 Proceedings of the 8th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part I
Dynamic programming algorithms for efficiently computing cosegmentations between biological images
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Efficient exponential time algorithms for edit distance between unordered trees
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Theoretical Computer Science
Matching problems with delta-matroid constraints
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Efficient exponential-time algorithms for edit distance between unordered trees
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We consider the following TREE-CONSTRAINED BIPARTITE MATCHING problem: Given two rooted trees T1 = (V1,E1), T2 = (V2, E2) and a weight function w: V1×V2 → R+, find a maximum weight matching M between nodes of the two trees, such that none of the matched nodes is an ancestor of another matched node in either of the trees. This generalization of the classical bipartite matching problem appears, for example, in the computational analysis of live cell video data. We show that the problem is APX-hard and thus, unless P = NP, disprove a previous claim that it is solvable in polynomial time. Furthermore, we give a 2-approximation algorithm based on a combination of the local ratio technique and a careful use of the structure of basic feasible solutions of a natural LP-relaxation, which we also show to have an integrality gap of 2 - o(1). In the second part of the paper, we consider a natural generalization of the problem, where trees are replaced by partially ordered sets (posets). We show that the local ratio technique gives a 2kρ-approximation for the k-dimensional matching generalization of the problem, in which the maximum number of incomparable elements below (or above) any given element in each poset is bounded by ρ. We finally give an almost matching integrality gap example, and an inapproximability result showing that the dependence on ρ is most likely unavoidable.