An efficient algorithm for the limited-capacity many-to-many point matching in one dimension

Matching elements from two sets (bipartite matching), a fundamental subject in computer science, is used in applications such as bipartite data matching (e.g. graph edit distance computation and semantic data matching) and allocating resources in a wireless network. Given two sets S and T , a limite...

Full description

Saved in:

Bibliographic Details
Published in:	The Journal of supercomputing Vol. 81; no. 8; p. 920
Main Authors:	Rajabi-Alni, Fatemeh, Minaei-Bidgoli, Behrouz, Bagheri, Alireza
Format:	Journal Article
Language:	English
Published:	New York Springer US 29.05.2025 Springer Nature B.V
Subjects:	Algorithms Compilers Computer Science Dynamic programming Energy consumption Euclidean geometry Interpreters Matching Processor Architectures Programming Languages Resource allocation Sensors Wireless networks Dynamic programming One-dimensional points Limited capacity Many-to-many matching
ISSN:	1573-0484, 0920-8542, 1573-0484
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!