Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling | Paper Citation Record

Observation 5aa802ef-ac8e-4ec2-b61e-12b7d7febdaa · outbound

This paper cites Brief announcement: Green paging and parallel paging.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Brief announcement: Green paging and parallel paging

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:53.078642Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ba422c23-4716-4e1c-b609-69a81c41568a · outbound

This paper cites Tight bounds of parallel paging and green paging.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Tight bounds of parallel paging and green paging

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:52.948405Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 306596c1-f573-424f-ad7a-7dc7c77b0b54 · outbound

This paper cites Bender, Rathish Das, William Kuszmaul, Enoch Peserico, and Michele Scquizzato.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Bender, Rathish Das, William Kuszmaul, Enoch Peserico, and Michele Scquizzato

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:52.774618Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 92caf5e3-4d0a-4078-8b12-490533e58282 · outbound

This paper cites Task scheduling techniques in cloud computing: A literature survey.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Task scheduling techniques in cloud computing: A literature survey

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:52.614031Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c3cf50cb-7cb9-4cb4-81d8-87d34619d665 · outbound

This paper cites Strip packing with precedence constraints and strip packing with release times.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Strip packing with precedence constraints and strip packing with release times

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:52.494953Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 786b5229-1e5c-4d25-8f6c-c2464f7f0801 · outbound

This paper cites On-line scheduling with precedence constraints.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling On-line scheduling with precedence constraints

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:52.361099Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 0a5cff45-0033-424f-a1bf-b98ebce53602 · outbound

This paper cites Shelf algorithms for two-dimensional packing problems.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Shelf algorithms for two-dimensional packing problems

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:52.246313Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation bf4110e2-42cb-4d20-84d3-a3553293ce05 · outbound

This paper cites An approximate algorithm for the partitionable independent task scheduling problem.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling An approximate algorithm for the partitionable independent task scheduling problem

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:52.104962Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 0d0f9232-3a0e-49af-9f5f-f4d325e184c6 · outbound

This paper cites An approximation algorithm for the shortest common supersequence problem: an experimental analysis.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling An approximation algorithm for the shortest common supersequence problem: an experimental analysis

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:51.920300Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 7dc428e0-64b5-4e88-a7e7-79864e2b9d22 · outbound

This paper cites Scheduling cilk multithreaded parallel programs on processors of different speeds.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Scheduling cilk multithreaded parallel programs on processors of different speeds

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:51.791819Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 1d1cf30a-6b15-4659-a418-d8dbbd94f83e · outbound

This paper cites Hoard: A scalable memory allocator for multithreaded applications.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Hoard: A scalable memory allocator for multithreaded applications

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:51.611368Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 83d78cfc-5a66-42e0-98d0-ebdeb51228cf · outbound

This paper cites Bhatia, S.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Bhatia, S

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:51.432589Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 0df02ac4-38cf-4ee0-9bdc-b3e26988b79e · outbound

This paper cites Cilk: An efficient multithreaded runtime system.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Cilk: An efficient multithreaded runtime system

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:51.229991Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 67a55c20-7e63-4124-b901-9c1e19840517 · outbound

This paper cites Space-efficient scheduling of multithreaded computations.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Space-efficient scheduling of multithreaded computations

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:51.070847Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 231c6b30-1b30-41ef-a66f-21bd8a5c78ce · outbound

This paper cites Scheduling multithreaded computations by work stealing.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Scheduling multithreaded computations by work stealing

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:50.831530Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 9f8fd24f-0f6f-4f54-8110-61714f73cd42 · outbound

This paper cites Resource-constrained project scheduling: Notation, classification, models, and methods.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Resource-constrained project scheduling: Notation, classification, models, and methods

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:50.645221Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 3f04cf8c-2cf0-4b15-84cb-b356c4c8570c · outbound

This paper cites On multidimensional packing problems.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling On multidimensional packing problems

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:50.503990Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 224f1154-253b-4492-9ac5-e831bfab3983 · outbound

This paper cites A 3.42-approximation algorithm for scheduling malleable tasks under precedence constraints.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling A 3.42-approximation algorithm for scheduling malleable tasks under precedence constraints

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:50.293252Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 87c94f0c-b494-4e0e-b2f3-cb035e95e625 · outbound

This paper cites Approximation and online algorithms for multidimensional bin packing: A survey.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Approximation and online algorithms for multidimensional bin packing: A survey

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:50.111738Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 4b34e116-c9fa-426f-aec4-929f9fdebef9 · outbound

This paper cites Introduction to algorithms.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Introduction to algorithms

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-05T13:13:05.464114Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b0d750d6-1826-48aa-9021-09855c21d107 · outbound

This paper cites Shelf algorithms for on-line strip packing.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Shelf algorithms for on-line strip packing

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:49.974260Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 52639df5-875a-4240-be01-dafa3a2d104e · outbound

This paper cites How to manage high-bandwidth memory automatically.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling How to manage high-bandwidth memory automatically

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:49.864905Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation baabd87c-5234-4aa8-b26a-a8d96afa70d9 · outbound

This paper cites Approximation hardness of resource scheduling.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Approximation hardness of resource scheduling

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:49.779029Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 4cbc9d98-e1e5-4f94-8b61-fc9b9bc5672a · outbound

This paper cites Data races and the discrete resource-time tradeoff problem with resource reuse over paths.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Data races and the discrete resource-time tradeoff problem with resource reuse over paths

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:49.682284Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ecd7e629-a301-4285-97d8-0f12577c46f6 · outbound

This paper cites Bender, Jonathan W.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Bender, Jonathan W

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:49.593239Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation d1c12ee9-edcb-43fc-8bf7-fe54d481585a · outbound

This paper cites Approximation algorithms for scheduling with resource and precedence constraints.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Approximation algorithms for scheduling with resource and precedence constraints

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:49.513319Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 2d505fa7-b416-484e-a25c-5bc696f09324 · outbound

This paper cites Approximation algorithms for capacitated k-median and scheduling with resource and precedence constraints.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Approximation algorithms for capacitated k-median and scheduling with resource and precedence constraints

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:49.445826Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation fff31e0d-1ba4-468c-8ddb-0ca6c037de56 · outbound

This paper cites Dynamic sharing of gpus in cloud systems.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Dynamic sharing of gpus in cloud systems

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:49.343255Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 927354b0-60b9-4af1-8f8f-f3dec17ce756 · outbound

This paper cites an unresolved cited work.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Unresolved cited work

Reference 29

Resolution: unresolved; raw_fallback, observed 2026-08-05T13:13:49.261540Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation f8249c2a-77c7-4d1a-9215-75b17f265810 · outbound

This paper cites Lower bounds for on-line scheduling with precedence constraints on identical machines.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Lower bounds for on-line scheduling with precedence constraints on identical machines

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:49.106526Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 49f6d5b7-5d50-4c99-ac3e-0ab931d5b594 · outbound

This paper cites A note on on-line scheduling with precedence constraints on identical machines.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling A note on on-line scheduling with precedence constraints on identical machines

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:48.890978Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 6135099c-a544-4b22-818f-0367dc02aa1e · outbound

This paper cites Optimal online scheduling of parallel jobs with dependencies.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Optimal online scheduling of parallel jobs with dependencies

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:48.791522Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c6f1b327-53b3-4b92-9f46-47bfb9729951 · outbound

This paper cites The implementation of the cilk-5 multithreaded language.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling The implementation of the cilk-5 multithreaded language

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:48.661012Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 3c5c8484-f1e6-484b-9d77-6317b8c10aa9 · outbound

This paper cites an unresolved cited work.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Unresolved cited work

Reference 34

Resolution: unresolved; raw_fallback, observed 2026-08-05T13:13:48.580534Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation d6e91294-8c96-44bd-9c69-3fa8e8d944bc · outbound

This paper cites Improved approximation results on the shortest common supersequence problem.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Improved approximation results on the shortest common supersequence problem

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:48.475692Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 8a30f0e2-12d6-4284-a67a-536a3c5b9982 · outbound

This paper cites Bounds for certain multiprocessing anomalies.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Bounds for certain multiprocessing anomalies

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:48.386394Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation a4826cf8-03b8-4027-b2ee-32d99673be1a · outbound

This paper cites Scheduling to minimize average completion time: Off-line and on-line approximation algorithms.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Scheduling to minimize average completion time: Off-line and on-line approximation algorithms

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:48.295108Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 92b3daee-1b30-43fa-86b7-8d9bfe9a0a31 · outbound

This paper cites Strip packing vs.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Strip packing vs

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:48.210805Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 6c9d22b9-e166-44ca-9e2c-7fdd1aeafd20 · outbound

This paper cites Online algorithm for parallel job scheduling and strip packing.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Online algorithm for parallel job scheduling and strip packing

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:48.091948Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ad93e69c-2f16-49ed-b04c-8d25bddff2bd · outbound

This paper cites Tight bounds for online vector scheduling.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Tight bounds for online vector scheduling

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:47.935362Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 37d080b0-1e02-4e5a-884c-f3ce3a4f2895 · outbound

This paper cites Linear-time approximation schemes for scheduling malleable parallel tasks.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Linear-time approximation schemes for scheduling malleable parallel tasks

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:16.219777Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 4e7845cc-0edc-4198-a3cb-8d719c99015c · outbound

This paper cites Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:13.344318Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 75c617de-d089-4778-830a-38ca32baafe2 · outbound

This paper cites Approximation schemes for machine scheduling with resource (in-) dependent processing times.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Approximation schemes for machine scheduling with resource (in-) dependent processing times

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:12.145633Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 5da8c53e-c773-477c-9f8b-02c3ee9d49e4 · outbound

This paper cites An approximation algorithm for scheduling malleable tasks under general precedence constraints.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling An approximation algorithm for scheduling malleable tasks under general precedence constraints

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:11.886825Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 0e2753d9-0815-4e3e-baf3-72c523f217bf · outbound

This paper cites On the approximation of shortest common supersequences and longest common subsequences.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling On the approximation of shortest common supersequences and longest common subsequences

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:11.562259Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 6328196a-6586-432e-8d4a-4f851fcb74a3 · outbound

This paper cites Scheduling tasks with precedence constraints on hybrid multi-core machines.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Scheduling tasks with precedence constraints on hybrid multi-core machines

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:11.203826Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c1e00369-8849-433f-9079-45838a32e5a4 · outbound

This paper cites An integrated survey of deterministic project scheduling.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling An integrated survey of deterministic project scheduling

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:11.090974Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 10693a1d-e9bc-4419-9dcd-7236caf61716 · outbound

This paper cites Minimalistic predictions to schedule jobs with online precedence constraints.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Minimalistic predictions to schedule jobs with online precedence constraints

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:10.882831Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 68443b60-12e1-48ff-9a79-ac953ee0507e · outbound

This paper cites an unresolved cited work.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Unresolved cited work

Reference 49

Resolution: unresolved; raw_fallback, observed 2026-08-05T13:13:10.684952Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ca018e10-da3b-4dcf-b4d7-588c9f0cafe9 · outbound

This paper cites An approximation algorithm for scheduling trees of malleable tasks.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling An approximation algorithm for scheduling trees of malleable tasks

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:10.525451Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation cb0ff80e-9048-48a5-a6cb-ceb191662bc4 · outbound

This paper cites Scheduling malleable and nonmalleable parallel tasks.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Scheduling malleable and nonmalleable parallel tasks

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:10.376429Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 26ce4dd3-6d8f-42cb-ba4f-4ab14658a587 · outbound

This paper cites (acyclic) job shops are hard to approximate.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling (acyclic) job shops are hard to approximate

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:10.226061Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 06afba35-f0da-45f5-ac2b-1ca00d5b9795 · outbound

This paper cites Stochastic online scheduling with precedence constraints.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Stochastic online scheduling with precedence constraints

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:10.056001Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 1cd465e4-8d3f-4c84-b9f6-bc6db5d7da09 · outbound

This paper cites Randomized algorithms.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Randomized algorithms

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:09.880542Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 30843fc6-9675-482a-927c-27db71c301ba · outbound

This paper cites Efficient approximation algorithms for scheduling malleable tasks.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Efficient approximation algorithms for scheduling malleable tasks

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:09.742278Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation cb0e1a1d-1e55-4906-a7e9-4049c9403903 · outbound

This paper cites Scheduling with an orthogonal resource constraint.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Scheduling with an orthogonal resource constraint

Reference 56

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:09.614065Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 2d93d51d-f689-454c-9a89-7e140c59ed61 · outbound

This paper cites Duella P.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Duella P

Reference 57

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:09.469558Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 4955fd7d-fe8e-476d-b662-6671b5271483 · outbound

This paper cites Multi-resource list scheduling of moldable parallel jobs under precedence constraints.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Multi-resource list scheduling of moldable parallel jobs under precedence constraints

Reference 58

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:09.277965Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 2be7c19b-d462-488a-b311-3562e883d854 · outbound

This paper cites A new algorithm for online scheduling of rigid task graphs with near-optimal competitive ratio.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling A new algorithm for online scheduling of rigid task graphs with near-optimal competitive ratio

Reference 59

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:09.106204Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation c147b370-52ac-4b11-919f-5d6b4dae5928 · outbound

This paper cites Approximation bounds for a general class of precedence constrained parallel machine scheduling problems.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Approximation bounds for a general class of precedence constrained parallel machine scheduling problems

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:08.950351Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ed8ef870-d266-4425-92a4-2c2ba9b7dddb · outbound

This paper cites The shortest common supersequence problem over binary alphabet is np-complete.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling The shortest common supersequence problem over binary alphabet is np-complete

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:08.816271Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation dd5efe37-8cde-403c-b064-37832d78ec94 · outbound

This paper cites Scalable locality-conscious multithreaded memory allocation.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Scalable locality-conscious multithreaded memory allocation

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:08.697082Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 459c38da-6453-4573-9916-0d0df319a0bf · outbound

This paper cites Conditional hardness of precedence constrained scheduling on identical machines.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Conditional hardness of precedence constrained scheduling on identical machines

Reference 63

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:08.582394Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation d7877185-4e1e-420f-8e88-3c9a56fbcb6f · outbound

This paper cites Introduction to cloud computing.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Introduction to cloud computing

Reference 64

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:08.442262Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation af7bf085-339a-4038-bdd5-7488d5dd64ad · outbound

This paper cites A note on online strip packing.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling A note on online strip packing

Reference 65

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:08.273758Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation d89a1ca8-c91a-46bb-baee-e8f20eeee0f5 · outbound

This paper cites Multimedia cloud computing.

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling Multimedia cloud computing

Reference 66

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T13:13:08.154576Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers