https://github.com/asolimando/hips
Given a weighted set of 2D points, it computes the Heaviest Increasing Point Subset
https://github.com/asolimando/hips
2d-points combinatorics heaviest-increasing-point-subset monotonically-increasing-function sequences
Last synced: 6 months ago
JSON representation
Given a weighted set of 2D points, it computes the Heaviest Increasing Point Subset
- Host: GitHub
- URL: https://github.com/asolimando/hips
- Owner: asolimando
- Created: 2017-10-22T22:06:03.000Z (over 8 years ago)
- Default Branch: master
- Last Pushed: 2022-05-26T09:25:26.000Z (almost 4 years ago)
- Last Synced: 2025-01-16T02:29:27.700Z (over 1 year ago)
- Topics: 2d-points, combinatorics, heaviest-increasing-point-subset, monotonically-increasing-function, sequences
- Language: Scala
- Size: 23.4 KB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# hips
Given a weighted set of 2D points, it computes the Heaviest Increasing Point Subset
The original code, re-implemented in Scala, has been written in the context of the research work available here: http://www.vldb.org/pvldb/vol6/p1630-solimando.pdf