A finite exact algorithm for epsilon-core membership in two dimensions
From MaRDI portal
Publication:607258
DOI10.1016/J.MATHSOCSCI.2010.07.004zbMATH Open1200.91095OpenAlexW1987689381MaRDI QIDQ607258FDOQ607258
Publication date: 19 November 2010
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2010.07.004
Recommendations
- On a generalization of the \(\epsilon\)-algorithm
- An algorithmic criterion for basicness in dimension 2
- An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions
- The epsilon algorithm and related topics
- Exact algorithms for size constrained 2-clustering in the plane
- Bounds for membership functions: A corelation-based approach
- scientific article; zbMATH DE number 2233588
- scientific article; zbMATH DE number 7759298
- The discrete Pólya algorithm on finite spaces
- An efficient exhaustive search algorithm for the Escherization problem
Cites Work
Cited In (1)
This page was built for publication: A finite exact algorithm for epsilon-core membership in two dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607258)