Image de couverture de livre

An $O(n^3)$ time algorithm for the maximum-weight limited-capacity many-to-many matching

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Rajabi-Alni, Fatemeh, Minaei-Bidgoli, Behrouz
Format:	Preprint
Publié:	2014
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Efficient Many-To-Many Matching of Points with Demands in One Dimension
par: Rajabi-Alni, Fatemeh, et autres
Publié: (2019)

Approximation Algorithms for the Freeze Tag Problem inside Polygons
par: Rajabi-Alni, Fatemeh, et autres
Publié: (2024)

How many users have been here for a long time? Efficient solutions for counting long aggregated visits
par: Afshani, Peyman, et autres
Publié: (2026)

A customizable inexact subgraph matching algorithm for attributed graphs
par: Benko, Tatyana, et autres
Publié: (2025)

Finding maximum matchings in RDV graphs efficiently
par: Biedl, Therese, et autres
Publié: (2024)

Downstream: efficient cross-platform algorithms for fixed-capacity stream downsampling
par: Yang, Connor, et autres
Publié: (2025)

Improved algorithms for single machine serial-batch scheduling to minimize makespan and maximum cost
par: Li, Shuguang, et autres
Publié: (2025)

Online matching with delays and stochastic arrival times
par: Mari, Mathieu, et autres
Publié: (2022)

A simpler and parallelizable $O(\sqrt{\log n})$-approximation algorithm for Sparsest Cut
par: Kolmogorov, Vladimir
Publié: (2023)

Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more
par: Karczmarz, Adam, et autres
Publié: (2024)

Brief announcement: A special case of maximum flow over time with network changes
par: Chawla, Shuchi, et autres
Publié: (2026)

A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs
par: Tsin, Yung H.
Publié: (2023)

A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma
par: Gupta, Sushmita, et autres
Publié: (2025)

Fully dynamic biconnectivity in $\tilde{\mathcal{O}}(\log^2 n)$ time
par: Holm, Jacob, et autres
Publié: (2025)

Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests
par: Mestel, David, et autres
Publié: (2024)

LZBE: an LZ-style compressor supporting $O(\log n)$-time random access
par: Shibata, Hiroki, et autres
Publié: (2025)

A practical algorithm for 3-admissibility
par: Awofeso, Christine, et autres
Publié: (2025)

Online matching on stochastic block model
par: Cherifa, Maria, et autres
Publié: (2025)

Suffix sorting via matching statistics
par: Lipták, Zsuzsanna, et autres
Publié: (2022)

Dynamic online matching with budget refills
par: Cherifa, Maria, et autres
Publié: (2024)

Testable algorithms for approximately counting edges and triangles in sublinear time and space
par: Eden, Talya, et autres
Publié: (2025)

Embedding Planar Graphs into Graphs of Treewidth $O(\log^{3} n)$
par: Chang, Hsien-Chih, et autres
Publié: (2024)

Faster parameterized algorithm for 3-Hitting Set
par: Tsur, Dekel
Publié: (2025)

Graph matching based on similarities in structure and attributes
par: Candelier, Raphaël
Publié: (2024)

Online matching games in bipartite expanders and applications
par: Bauwens, Bruno, et autres
Publié: (2022)

Counting perfect matchings and Hamiltonian cycles faster
par: Li, Baitian
Publié: (2023)

A $(2+\varepsilon)$-approximation algorithm for the general scheduling problem in quasipolynomial time
par: Armbruster, Alexander, et autres
Publié: (2025)

Coloring for dispersion: A polynomial-time algorithm for cardinality-constrained 2-anticlustering
par: Tran, Nguyen Khoa, et autres
Publié: (2026)

Binary weights spanning trees and the $k$-red spanning tree problem in linear time
par: Hochbaum, Dorit S.
Publié: (2024)

A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm
par: Lecroq, Thierry
Publié: (2024)

Generalising the maximum independent set algorithm via Boolean networks
par: Gadouleau, Maximilien, et autres
Publié: (2024)

Computing maximal palindromes in non-standard matching models
par: Mieno, Takuya, et autres
Publié: (2022)

Faster two-dimensional pattern matching with $k$ mismatches
par: Ellert, Jonas, et autres
Publié: (2024)

Constant time enumeration of perfect bipartite matchings
par: Fink, Jiří
Publié: (2025)

Treewidth of the $n \times n$ toroidal grid
par: Gima, Tatsuya, et autres
Publié: (2026)

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
par: Tu, Sijing, et autres
Publié: (2025)

On the Hardness Hierarchy for the $O(n \sqrt{\log n})$ Complexity in the Word RAM
par: Kempa, Dominik, et autres
Publié: (2025)

Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n loglog n)
par: Elkin, Michael, et autres
Publié: (2023)

Finding a solution to the Erdős-Ginzburg-Ziv theorem in $O(n\log\log\log n)$ time
par: Leung, Yui Hin Arvin
Publié: (2025)

A framework for boosting matching approximation: parallel, distributed, and dynamic
par: Mitrović, Slobodan, et autres
Publié: (2025)