On the public citation graph
Combinatorial Algorithm for Restricted Max-Min Fair Allocation
0 signed · 51 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_61openalex-snapshot
Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation
inferredcites →https://doi.org/10.1007/bf01585745openalex-snapshot
Approximation algorithms for scheduling unrelated parallel machines
inferredcites →https://doi.org/10.1007/bf01793010openalex-snapshot
A condition for matchability in hypergraphs
inferredcites →https://doi.org/10.1109/focs.2009.51openalex-snapshot
On Allocating Goods to Maximize Fairness
inferredcites →https://doi.org/10.1112/plms/s2-17.1.75openalex-snapshot
Asymptotic Formulaae in Combinatory Analysis
inferredcites →https://doi.org/10.1137/1.9781611974331.ch126openalex-snapshot
Finding Perfect Matchings in Bipartite Hypergraphs
inferredcites →https://doi.org/10.1137/110851201openalex-snapshot
Santa Claus Schedules Jobs on Unrelated Machines
inferredcites →https://doi.org/10.1145/1250790.1250808openalex-snapshot
An approximation algorithm for max-min fair allocation of indivisible goods
inferredcites →https://doi.org/10.1145/1536414.1536488openalex-snapshot
MaxMin allocation via degree lower-bounded arborescences
inferredcites →https://doi.org/10.1145/2049697.2049702openalex-snapshot
New Constructive Aspects of the Lovász Local Lemma
inferredcites →https://doi.org/10.1145/2229163.2229168openalex-snapshot
Santa claus meets hypergraph matchings
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2008.1767openalex-snapshot
On Estimation Algorithms vs Approximation Algorithms
inferredcites →https://doi.org/10.48550/arxiv.1001.1470openalex-snapshot
A New Approximation Technique for Resource-Allocation Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-48966-3_12openalex-snapshot
Fair Packing of Independent Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_6openalex-snapshot
General Max-Min Fair Allocation
inferred← citeshttps://doi.org/10.1007/978-3-032-08560-3_15openalex-snapshot
Almost Envy-Free Allocation of Indivisible Goods: A Tale of Two Valuations
inferred← citeshttps://doi.org/10.1007/978-3-032-17156-6_22openalex-snapshot
Parameterized Hardness Results for the Restricted Santa Claus Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_30openalex-snapshot
Structural Parameters for Scheduling with Assignment Restrictions
inferred← citeshttps://doi.org/10.1007/s00224-025-10241-yopenalex-snapshot
A Geometric Programming Approach to Solve the Restricted Assignment Case of the Santa Claus Problem
inferred← citeshttps://doi.org/10.1007/s00453-022-00942-yopenalex-snapshot
Restricted Max-Min Allocation: Integrality Gap and Approximation Algorithm
inferred← citeshttps://doi.org/10.1007/s00453-022-01079-8openalex-snapshot
Fair Allocation of Indivisible Items with Conflict Graphs
inferred← citeshttps://doi.org/10.1007/s00453-023-01105-3openalex-snapshot
Polynomial-time Combinatorial Algorithm for General Max–Min Fair Allocation
inferred← citeshttps://doi.org/10.1007/s00493-017-3567-2openalex-snapshot
Finding Perfect Matchings in Bipartite Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00493-025-00141-7openalex-snapshot
Improved Integrality Gap in Max–Min Allocation, or, Topology at the North Pole
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103820openalex-snapshot
Fair and efficient allocation with few agent types, few item types, or small value levels
inferred← citeshttps://doi.org/10.1016/j.dam.2020.07.014openalex-snapshot
On the star decomposition of a graph: Hardness results and approximation for the max–min optimization problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2019.01.071openalex-snapshot
Max-min fair allocation for resources with hybrid divisibilities
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.106025openalex-snapshot
A note on the integrality gap of the configuration LP for restricted Santa Claus
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.015openalex-snapshot
Structural parameters for scheduling with assignment restrictions
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.08.027openalex-snapshot
Multistage online maxmin allocation of indivisible entities
inferred← citeshttps://doi.org/10.1109/wowmom49955.2020.00057openalex-snapshot
Collective Subscriptions: A Novel Funding Tool for Crowdsourced Network Infrastructures
inferred← citeshttps://doi.org/10.1137/1.9781611973730.73openalex-snapshot
On (1,∊)-Restricted Assignment Makespan Minimization
inferred← citeshttps://doi.org/10.1137/1.9781611977912.100openalex-snapshot
Santa Claus meets Makespan and Matroids: Algorithms and Reductions
inferred← citeshttps://doi.org/10.1137/15m1053682openalex-snapshot
Approximating the Nash Social Welfare with Indivisible Items
inferred← citeshttps://doi.org/10.1137/19m128257xopenalex-snapshot
A Quasi-Polynomial Approximation for the Restricted Assignment Problem
inferred← citeshttps://doi.org/10.1145/3406325openalex-snapshot
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
inferred← citeshttps://doi.org/10.1145/3406325.3451031openalex-snapshot
Approximating Nash social welfare under rado valuations
inferred← citeshttps://doi.org/10.1145/3465456.3467614openalex-snapshot
Efficient Approximation Schemes for Stochastic Probing and Prophet Problems
inferred← citeshttps://doi.org/10.1145/3816782.3819185openalex-snapshot
Brief Announcement: Scheduling Problems with Constrained Rejections
inferred← citeshttps://doi.org/10.1287/moor.2023.0242openalex-snapshot
Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
inferred← citeshttps://doi.org/10.24963/ijcai.2020/7openalex-snapshot
Uniform Welfare Guarantees Under Identical Subadditive Valuations
inferred← citeshttps://doi.org/10.24963/ijcai.2022/3openalex-snapshot
An EF2X Allocation Protocol for Restricted Additive Valuations
inferred← citeshttps://doi.org/10.26481/dis.20221129mbopenalex-snapshot
Hiking in the scheduling landscape
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.22openalex-snapshot
The Submodular Santa Claus Problem in the Restricted Assignment Case
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2020.5openalex-snapshot
Inapproximability Results for Scheduling with Interval and Resource Restrictions
inferred← citeshttps://doi.org/10.48550/arxiv.1704.00222openalex-snapshot
Fair Allocation of Indivisible Goods: Improvement and Generalization
inferred← citeshttps://doi.org/10.48550/arxiv.2007.09116openalex-snapshot
The Combinatorial Santa Claus Problem or: How to Find Good Matchings in Non-Uniform Hypergraphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.