On the public citation graph

On the configuration-LP for scheduling on unrelated machines

https://doi.org/10.1007/s10951-013-0359-4
0 signed · 56 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1099-1425(199909/10)2:5<203::aid-jos26>3.0.co;2-5openalex-snapshot
Polynomial time approximation algorithms for machine scheduling: ten open problems
inferredcites →https://doi.org/10.1007/978-3-642-23719-5_45openalex-snapshot
On the Configuration-LP for Scheduling on Unrelated Machines
inferredcites →https://doi.org/10.1007/bf01585178openalex-snapshot
An approximation algorithm for the generalized assignment problem
inferredcites →https://doi.org/10.1007/bf01585745openalex-snapshot
Approximation algorithms for scheduling unrelated parallel machines
inferredcites →https://doi.org/10.1007/s00453-012-9668-9openalex-snapshot
Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines
inferredcites →https://doi.org/10.1007/s10951-013-0359-4openalex-snapshot
On the configuration-LP for scheduling on unrelated machines
inferredcites →https://doi.org/10.1016/j.ijpe.2008.09.003openalex-snapshot
Scheduling with processing set restrictions: A survey
inferredcites →https://doi.org/10.1016/j.ipl.2009.09.015openalex-snapshot
A note on graph balancing problems with restrictions
inferredcites →https://doi.org/10.1016/j.orl.2004.05.004openalex-snapshot
An optimal rounding gives a better approximation for scheduling unrelated machines
inferredcites →https://doi.org/10.1016/j.tcs.2007.02.056openalex-snapshot
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
inferredcites →https://doi.org/10.1016/s0167-6377(96)00047-8openalex-snapshot
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
inferredcites →https://doi.org/10.1016/s0377-2217(02)00914-1openalex-snapshot
Parallel machine scheduling of machine-dependent jobs with unit-length
inferredcites →https://doi.org/10.1109/focs.2009.51openalex-snapshot
On Allocating Goods to Maximize Fairness
inferredcites →https://doi.org/10.1109/sfcs.1982.61openalex-snapshot
An efficient approximation scheme for the one-dimensional bin-packing problem
inferredcites →https://doi.org/10.1137/080723491openalex-snapshot
An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
inferredcites →https://doi.org/10.1137/110851201openalex-snapshot
Santa Claus Schedules Jobs on Unrelated Machines
inferredcites →https://doi.org/10.1145/1132516.1132522openalex-snapshot
The Santa Claus problem
inferredcites →https://doi.org/10.1145/129712.129787openalex-snapshot
e-approximations with minimum packing constraint violation (extended abstract)
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.1145/2483699.2483704openalex-snapshot
Bin Packing via Discrepancy of Permutations
inferredcites →https://doi.org/10.1145/321941.321951openalex-snapshot
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
inferredcites →https://doi.org/10.1145/322092.322101openalex-snapshot
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
inferredcites →https://doi.org/10.1145/7531.7535openalex-snapshot
Using dual approximation algorithms for scheduling problems theoretical and practical results
inferredcites →https://doi.org/10.1184/r1/6607142openalex-snapshot
Max-min fair allocation of indivisible goods
inferredcites →https://doi.org/10.1287/moor.1110.0520openalex-snapshot
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4140756openalex-extracted
inferred← citeshttps://doi.org/10.2139/ssrn.4745629openalex-extracted
Online Job Assignment
inferred← citeshttps://doi.org/10.1007/978-3-030-39479-0_15openalex-snapshot
Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs
inferred← citeshttps://doi.org/10.1007/978-3-031-74580-5_5openalex-snapshot
On the Min-Max Star Partitioning Number
inferred← citeshttps://doi.org/10.1007/978-3-319-07557-0_28openalex-snapshot
On the Configuration LP for Maximum Budgeted Allocation
inferred← citeshttps://doi.org/10.1007/978-3-319-33461-5_13openalex-snapshot
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines
inferred← citeshttps://doi.org/10.1007/s00224-021-10037-wopenalex-snapshot
Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs
inferred← citeshttps://doi.org/10.1007/s00453-020-00679-6openalex-snapshot
Parameterized Orientable Deletion
inferred← citeshttps://doi.org/10.1007/s00453-021-00797-9openalex-snapshot
Optimal Matroid Partitioning Problems
inferred← citeshttps://doi.org/10.1007/s10107-014-0831-8openalex-snapshot
Strong LP formulations for scheduling splittable jobs on unrelated machines
inferred← citeshttps://doi.org/10.1007/s10107-017-1152-5openalex-snapshot
Semidefinite and linear programming integrality gaps for scheduling identical machines
inferred← citeshttps://doi.org/10.1007/s10878-018-0339-xopenalex-snapshot
Approximation algorithms for the graph balancing problem with two speeds and two job lengths
inferred← citeshttps://doi.org/10.1016/j.ijpe.2022.108555openalex-snapshot
A Multi-Machine Scheduling Solution for Homogeneous Processing: Asymptotic Approximation and Applications
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.009openalex-snapshot
Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments
inferred← citeshttps://doi.org/10.1137/1.9781611973730.73openalex-snapshot
On (1,∊)-Restricted Assignment Makespan Minimization
inferred← citeshttps://doi.org/10.1145/1993636.1993718openalex-snapshot
Santa Claus schedules jobs on unrelated machines
inferred← citeshttps://doi.org/10.1145/3410220.3460096openalex-snapshot
Real-time Approximate Routing for Smart Transit Systems
inferred← citeshttps://doi.org/10.1145/3460091openalex-snapshot
Real-time Approximate Routing for Smart Transit Systems
inferred← citeshttps://doi.org/10.1145/3543516.3460096openalex-snapshot
Real-time Approximate Routing for Smart Transit Systems
inferred← citeshttps://doi.org/10.1145/3564246.3585174openalex-snapshot
Better Trees for Santa Claus
inferred← citeshttps://doi.org/10.1145/3718360openalex-snapshot
Truthful Allocation in Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1145/3816782.3819185openalex-snapshot
Brief Announcement: Scheduling Problems with Constrained Rejections
inferred← citeshttps://doi.org/10.3390/a9020038openalex-snapshot
A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights
inferred← citeshttps://doi.org/10.4230/lipics.esa.2016.49openalex-snapshot
A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges
inferred← citeshttps://doi.org/10.48550/arxiv.1509.01630openalex-snapshot
Optimization and Reoptimization in Scheduling Problems
inferred← citeshttps://doi.org/10.5267/j.ijiec.2015.1.001openalex-snapshot
An ordered heuristic for the allocation of resources in unrelated parallel-machines
inferred← citeshttps://doi.org/10.5555/2884435.2884509openalex-snapshot
An improved approximation guarantee for the maximum budgeted allocation problem
inferred← citeshttps://doi.org/10.70675/7c077eefz7a43z411bz9443zd07cf97770b4openalex-snapshot
Convex and online optimization : applications to scheduling and selection problems
showing the first 28 of 29
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.