# 3-dimensional matching

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- APPROX-RANDOM
- 2014

We present a (4 + ) approximation algorithm for weighted graph matching which applies in the semistreaming, sliding window, andâ€¦Â (More)

Is this relevant?

2013

2013

- IEEE 54th Annual Symposium on Foundations ofâ€¦
- 2013

One of the most natural optimization problems is the k-SET PACKING problem, where given a family of sets of size at most k oneâ€¦Â (More)

Is this relevant?

2013

2013

- ArXiv
- 2013

We show how the implementation of conservative logic gates on flow networks suggests a way to solve 3SAT and 3-dimensionalâ€¦Â (More)

Is this relevant?

Highly Cited

2013

Highly Cited

2013

- ACM Trans. Database Syst.
- 2013

Graph pattern matching is commonly used in a variety of emerging applications such as social network analysis. These applicationsâ€¦Â (More)

Is this relevant?

2011

2011

- 2011

In this paper, we study the local behavior of the solutions to the 3-dimensional magnetohydrodynamic equations. We are interestedâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- IEEE Transactions on Pattern Analysis and Machineâ€¦
- 2009

This paper addresses the problem of establishing correspondences between two sets of visual features using higher orderâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- IEEE Conference on Computer Vision and Patternâ€¦
- 2008

We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyondâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- 2004

We use ground-based observations of CO mixing ratios and vertical column abundances together with tropo-spheric NO 2 columns fromâ€¦Â (More)

Is this relevant?

2001

2001

- 2001

For a group G, the notion of a ribbon G-category was introduced in Turaev (Homotopy 4eld theory in dimension 3 and crossed groupâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Inf. Process. Lett.
- 1991

We prove that maximum three dimensional matching is a MAX SNP-hard problem. If the number of occurrences of elements in triplesâ€¦Â (More)

Is this relevant?