Cover Image

Efficient Many-To-Many Matching of Points with Demands in One Dimension

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Rajabi-Alni, Fatemeh, Minaei-Bidgoli, Behrouz
Format:	Preprint
Published:	2019
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Approximation Algorithms for the Freeze Tag Problem inside Polygons
by: Rajabi-Alni, Fatemeh, et al.
Published: (2024)

An $O(n^3)$ time algorithm for the maximum-weight limited-capacity many-to-many matching
by: Rajabi-Alni, Fatemeh, et al.
Published: (2014)

The Complexity of One or Many Faces in the Overlay of Many Arrangements
by: Har-Peled, Sariel
Published: (2025)

Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
by: Park, Seongbin, et al.
Published: (2026)

PESTS: Persian_English Cross Lingual Corpus for Semantic Textual Similarity
by: Abdous, Mohammad, et al.
Published: (2023)

Bactrainus: Optimizing Large Language Models for Multi-hop Complex Question Answering Tasks
by: Barati, Iman, et al.
Published: (2025)

A New Method for Cross-Lingual-based Semantic Role Labeling
by: Ebrahimi, Mohammad, et al.
Published: (2024)

An $O(n \log n)$-Time Approximation Scheme for Geometric Many-to-Many Matching
by: Bandyapadhyay, Sayan, et al.
Published: (2024)

An Optimal Algorithm for Computing Many Faces in Line Arrangements
by: Wang, Haitao
Published: (2026)

How Many Slopes Does Polynomial Area Cost?
by: Bekos, Michael A., et al.
Published: (2026)

DREaM: Drug-Drug Relation Extraction via Transfer Learning Method
by: Fata, Ali, et al.
Published: (2025)

Finding a Shortest Curve that Separates Few Objects from Many
by: Biedl, Therese, et al.
Published: (2025)

Noor-Ghateh: A Benchmark Dataset for Evaluating Arabic Word Segmenters in Hadith Domain
by: AlShuhayeb, Huda, et al.
Published: (2023)

Too Many or Too Few? Sampling Bounds for Topological Descriptors
by: Fasy, Brittany Terese, et al.
Published: (2025)

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
by: Barequet, Gill, et al.
Published: (2025)

A Strategy for Implementing description Temporal Dynamic Algorithms in Dynamic Knowledge Graphs by SPIN
by: Shahbazi, Alireza, et al.
Published: (2024)

Many equiprojective polytopes
by: Buffière, Théophile, et al.
Published: (2023)

Identifiability of Points and Rigidity of Hypergraphs under Algebraic Constraints
by: Cruickshank, James, et al.
Published: (2023)

FARSIQA: Faithful and Advanced RAG System for Islamic Question Answering
by: Asl, Mohammad Aghajani, et al.
Published: (2025)

Parameterized Complexity of Fair Many-to-One Matchings
by: Javadi, Ramin, et al.
Published: (2024)

Positive Braid Links with Infinitely Many Fillings
by: Gao, Honghao, et al.
Published: (2020)

Buy-Many Mechanisms for Many Unit-Demand Buyers
by: Chawla, Shuchi, et al.
Published: (2022)

Polytime Algorithms for One-to-Many Matching Games
by: Garrido-Lucero, Felipe, et al.
Published: (2021)

Many antipodes implies many neighbors
by: Steinerberger, Stefan
Published: (2025)

Two-Sided Fairness in Many-to-One Matching
by: Igarashi, Ayumi, et al.
Published: (2025)

Space-Efficient Approximate Spherical Range Counting in High Dimensions
by: Kalavas, Andreas, et al.
Published: (2026)

Video Individual Counting With Implicit One-to-Many Matching
by: Zhu, Xuhui, et al.
Published: (2025)

Optimal Capacity Modification for Many-To-One Matching Problems
by: Chen, Jiehua, et al.
Published: (2023)

Rezwan: Leveraging Large Language Models for Comprehensive Hadith Text Processing: A 1.2M Corpus Development
by: Asgari-Bidhendi, Majid, et al.
Published: (2025)

Many partitions of mass assignments
by: Blagojevic, Pavle V. M., et al.
Published: (2023)

Efficient Algorithms for Maximal Matroid Degenerations and Irreducible Decompositions of Circuit Varieties
by: Liwski, Emiliano, et al.
Published: (2025)

Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching
by: Glitzner, Frederik, et al.
Published: (2025)

The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
by: Inoue, Yuta, et al.
Published: (2026)

Boundedness results for families of non-canonically polarized projective varieties
by: Ascher, Kenneth, et al.
Published: (2024)

A Combinatorial Structure for Many Hierarchically Hyperbolic Spaces
by: Hagen, Mark, et al.
Published: (2023)

A Vanishing Theorem for Varieties with Finitely Many Solvable Group Orbits
by: Wang, Yiyu
Published: (2023)

Efficient Neighbourhood Search in 3D Point Clouds Through Space-Filling Curves and Linear Octrees
by: Viñambres, Pablo D., et al.
Published: (2026)

Connected Matchings
by: Aichholzer, Oswin, et al.
Published: (2024)

Infinitely Many Surfaces with Prescribed Mean Curvature in the Presence of a Strictly Stable Minimal Surface
by: Gaspar, Pedro, et al.
Published: (2025)

FAIR-RAG: Faithful Adaptive Iterative Refinement for Retrieval-Augmented Generation
by: Asl, Mohammad Aghajani, et al.
Published: (2025)