Image de couverture de livre

Stability Notions for Hospital Residents with Sizes

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Balasundaram, Haricharan, Krishnashree, J B, Limaye, Girija, Nasre, Meghana
Format:	Preprint
Publié:	2025
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

Generalized Capacity Planning for the Hospital-Residents Problem
par: Balasundaram, Haricharan, et autres
Publié: (2025)

Convex Optimization with Nested Evolving Feasible Sets
par: M., Karthick Krishna, et autres
Publié: (2026)

Optimal Capacity Modification for Stable Matchings with Ties
par: Ranjan, Keshav, et autres
Publié: (2024)

Critical Relaxed-Stable Matchings with Ties in the Many-to-Many Setting
par: Nasre, Meghana, et autres
Publié: (2023)

Group Fairness and Multi-criteria Optimization in School Assignment
par: A., Santhini K., et autres
Publié: (2024)

Refining the Adaptivity Notion in the Huge Object Model
par: Adar, Tomer, et autres
Publié: (2023)

Efficient Dynamic MaxFlow Computation on GPUs
par: Kannappan, Shruthi, et autres
Publié: (2025)

Masked Matrix Multiplication for Emergent Sparsity
par: Wheatman, Brian, et autres
Publié: (2024)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
par: Austrin, Per, et autres
Publié: (2024)

On the Smallest Size of Internal Collage Systems
par: Migita, Soichiro, et autres
Publié: (2025)

Size-constrained Weighted Ancestors with Applications
par: Bille, Philip, et autres
Publié: (2023)

Simple Linear-Size Additive Emulators
par: Hoppenworth, Gary
Publié: (2023)

Online Bin Packing with Item Size Estimates
par: Gehnen, Matthias, et autres
Publié: (2025)

Streaming Edge Coloring with Subquadratic Palette Size
par: Chechik, Shiri, et autres
Publié: (2023)

Almost Linear Size Edit Distance Sketch
par: Koucký, Michal, et autres
Publié: (2024)

Faster Linear-Size And-Or Path and Adder Circuits
par: Brenner, Ulrich, et autres
Publié: (2024)

String Representation in Suffixient Set Size Space
par: Shibata, Hiroki, et autres
Publié: (2026)

Online Matching with Delays and Size-based Costs
par: Kawase, Yasushi, et autres
Publié: (2024)

Path-Reporting Distance Oracles with Linear Size
par: Neiman, Ofer, et autres
Publié: (2024)

Reconfiguring Multiple Connected Components with Size Multiset Constraints
par: Nakahata, Yu
Publié: (2025)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
par: Gupta, Swati, et autres
Publié: (2023)

Parameterized Algorithms for Spanning Tree Isomorphism by Redundant Set Size
par: Shen, Fangjian, et autres
Publié: (2025)

Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time
par: Jin, Wenyu, et autres
Publié: (2024)

Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
par: Khanna, Sanjeev, et autres
Publié: (2024)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
par: Conte, Alessio, et autres
Publié: (2024)

Witty: An Efficient Solver for Computing Minimum-Size Decision Trees
par: Staus, Luca Pascal, et autres
Publié: (2024)

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
par: Hermann, Stefan, et autres
Publié: (2024)

Individual Fairness under Varied Notions of Group Fairness in Bipartite Matching - One Framework to Approximate Them All
par: Panda, Atasi, et autres
Publié: (2022)

Improved Bounds with a Simple Algorithm for Edge Estimation for Graphs of Unknown Size
par: Chanda, Debarshi
Publié: (2025)

Color Fault-Tolerant Distance Preservers: Õptimal Size in Conditionally Õptimal Time
par: Parter, Merav, et autres
Publié: (2025)

Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time
par: El-Hayek, Antoine, et autres
Publié: (2025)

Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries
par: Shah, Vihan
Publié: (2026)

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

Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time
par: Hua, Kevin, et autres
Publié: (2024)

Sampling Colorings with Fixed Color Class Sizes
par: Kuchukova, Aiya, et autres
Publié: (2026)

Characterizing and Testing Configuration Stability in Two-Dimensional Threshold Cellular Automata
par: Nakar, Yonatan, et autres
Publié: (2025)

Sensitivity Sampling for $k$-Means: Worst Case and Stability Optimal Coreset Bounds
par: Bansal, Nikhil, et autres
Publié: (2024)

An $O(n\log n)$ Algorithm for Single-Item Lot Sizing with a One-Breakpoint All-Units Discount and Non-Increasing Prices
par: Papadopoulos, Kleitos
Publié: (2025)

A Sampling Lovász Local Lemma for Large Domain Sizes
par: Wang, Chunyang, et autres
Publié: (2023)