Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-05-09T20:48:14.468676Z
Paper Citation Record · LEDGER
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
As of 4 August 2026, this Paper Citation Record lists 96 of 96 outbound references and 0 inbound Pith citation observations for arXiv:2605.05233.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-04T06:34:03.388597+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
96 of 96 outbound references displayed
- verified exact27
- verified fuzzy62
- unresolved4
- parse uncertain0
- malformed identifier0
- metadata mismatch3
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 7f6fcfa7-6f3c-4131-9417-f06edaea36dd · outbound
This paper cites Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX) , pages =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX) , pages =
Reference 1
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.599705Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 8b2613dc-8755-4c61-9fda-74e3a4f82656 · outbound
This paper cites an unresolved cited work.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Unresolved cited work
Reference 2
- Resolution
- verified exact
- arxiv_id, observed 2026-05-09T20:52:59.614987Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation dd3c15dd-d239-4fea-a35a-9e031be5ade8 · outbound
This paper cites ACM SIGecom Exchanges , volume =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems ACM SIGecom Exchanges , volume =
Reference 3
- Resolution
- verified exact
- arxiv_id, observed 2026-05-09T20:52:59.605466Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 472ecd6a-f3e6-4b9a-ab10-4eb79d1333cb · outbound
This paper cites Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI) , pages =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI) , pages =
Reference 4
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.596681Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 58d3a4bd-5a5c-44b9-a455-d7bb5ab05b20 · outbound
This paper cites SIAM Journal on Optimization , volume =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems SIAM Journal on Optimization , volume =
Reference 5
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.602152Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 8cabf022-a2e2-4305-a896-10720f2bbd9d · outbound
This paper cites an unresolved cited work.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Unresolved cited work
Reference 6
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.617410Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 6e468111-d4de-4361-8137-b851fb0795ef · outbound
This paper cites Journal of Heuristics , volume =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Journal of Heuristics , volume =
Reference 7
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.619578Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation a1a6bcb1-d9bf-4320-a65b-c86c9313c5cb · outbound
This paper cites Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , pages =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , pages =
Reference 8
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.607680Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 807728fc-a31b-4b51-b716-45f23a7384a0 · outbound
This paper cites SIAM Journal on Computing , volume =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems SIAM Journal on Computing , volume =
Reference 9
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.609801Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 49a127df-e55f-452e-a177-e9a61df4efb6 · outbound
This paper cites Optimization Letters , pages =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Optimization Letters , pages =
Reference 10
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.611921Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 0b130e28-f662-4363-ba17-aaf746e5d59d · outbound
This paper cites Algorithmica , volume =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Algorithmica , volume =
Reference 11
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.626262Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation bc301497-d6aa-4e82-8f23-020c7ca8c165 · outbound
This paper cites Combinatorica 1(4), 349–355 (1981).https://doi.org/10.1007/BF02579456.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Combinatorica 1(4), 349–355 (1981).https://doi.org/10.1007/BF02579456
Reference 12
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.638087Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation ca4a2414-73c1-4b7b-a520-d7064a8501f2 · outbound
This paper cites Proceedings of the International Conference on Algorithms and Complexity (CIAC) , pages =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the International Conference on Algorithms and Complexity (CIAC) , pages =
Reference 13
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.645335Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 89546422-530d-4040-a7ed-9a5ea5fd673b · outbound
This paper cites Theoretical Computer Science , volume =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Theoretical Computer Science , volume =
Reference 14
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.621843Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation bdd46c5b-e2fc-4864-a568-7ec9413b899d · outbound
This paper cites 14 Dorit S.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems 14 Dorit S
Reference 15
- Resolution
- metadata mismatch
- arxiv_id, observed 2026-05-09T20:52:59.648615Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation ccf8bba2-463e-47ee-8b43-18471b016186 · outbound
This paper cites Hopcroft and Richard M.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Hopcroft and Richard M
Reference 16
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.635829Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation fab7df87-70b6-482b-8293-1aeeafc6fd9d · outbound
This paper cites ACM Transactions on Economics and Computation , volume =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems ACM Transactions on Economics and Computation , volume =
Reference 17
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.654025Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 6a802144-6122-4dd1-b8e3-86bed214c170 · outbound
This paper cites Proceedings of the European Conference on Multi-Agent Systems (EUMAS) , pages =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the European Conference on Multi-Agent Systems (EUMAS) , pages =
Reference 18
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.633286Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 84b98bdf-0d03-4179-a14d-effa481c5042 · outbound
This paper cites SIAM Journal on Computing , volume =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems SIAM Journal on Computing , volume =
Reference 19
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.656754Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 1e61a811-f0c4-4b6e-88a6-9d1b6e1a9ab6 · outbound
This paper cites Proceedings of the 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) , pages =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) , pages =
Reference 20
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.640295Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 8a7b1555-6137-45b2-8b7b-c427c18c4554 · outbound
This paper cites Minkowski's Convex Body Theorem and Integer Programming , volume =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Minkowski's Convex Body Theorem and Integer Programming , volume =
Reference 21
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.624069Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation ff660340-d186-4396-8d40-cb468b98b3c1 · outbound
This paper cites Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX) , pages =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX) , pages =
Reference 22
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.642988Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation c8d6fe0e-9e76-48a1-ae87-a0c0da0b3474 · outbound
This paper cites Algorithmica , volume =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Algorithmica , volume =
Reference 23
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.628435Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 12dfa280-2c06-44bf-9dea-7868207b2ea8 · outbound
This paper cites Shmoys and.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Shmoys and
Reference 24
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.630620Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation c02f0629-9bae-45fc-921d-15e16bef03c8 · outbound
This paper cites 26 Joseph Y-T Leung and Chung-Lun Li.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems 26 Joseph Y-T Leung and Chung-Lun Li
Reference 25
- Resolution
- metadata mismatch
- doi, observed 2026-05-09T20:52:59.651588Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 9a06bf2c-833e-42f7-8023-20b61733592a · outbound
This paper cites Random Structures & Algorithms , volume =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Random Structures & Algorithms , volume =
Reference 26
- Resolution
- verified exact
- doi, observed 2026-05-09T20:52:59.590898Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation c09f2300-55b3-420c-bfc9-86f2b637d512 · outbound
This paper cites 2011 , publisher =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems 2011 , publisher =
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.777749Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation e0e19bc7-e0fe-46f9-8629-cbfa7f547d51 · outbound
This paper cites Marten Maack and Klaus Jansen 25 A Examples for Section 2 Example Simple Reduction.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Marten Maack and Klaus Jansen 25 A Examples for Section 2 Example Simple Reduction
Reference 28
- Resolution
- metadata mismatch
- doi, observed 2026-05-09T20:52:59.588551Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation e0223db5-bec1-4156-a3bc-9f085e233c00 · outbound
This paper cites Journal of Scheduling , volume =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Journal of Scheduling , volume =
Reference 29
- Resolution
- verified exact
- arxiv_id, observed 2026-05-09T20:52:59.594057Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 6b5dac3d-a4d1-4570-8f49-e4ebd89182d6 · outbound
This paper cites SIAM Journal on Optimization , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems SIAM Journal on Optimization , volume=
Reference 30
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.757752Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 65c125dd-e569-4741-9287-33b6393ae89c · outbound
This paper cites Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , volume=
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.829498Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation b44fd84d-3c0c-4a98-a856-728832638ac8 · outbound
This paper cites ACM Transactions on Economics and Computation , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems ACM Transactions on Economics and Computation , volume=
Reference 32
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.832888Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 9db6d1c2-3322-4637-a8b0-227f49f406af · outbound
This paper cites Optimization Letters , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Optimization Letters , pages=
Reference 33
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.773642Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 20c14b2b-afd9-4315-a57a-1123bf2eea3d · outbound
This paper cites SIAM Journal on Computing , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems SIAM Journal on Computing , volume=
Reference 34
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.761087Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 3a58bfa5-89ab-4497-8315-874f0c58da04 · outbound
This paper cites Proceedings of the International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM) , pages=
Reference 35
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.789208Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 344e279a-8c3a-4e22-9201-2d49dd1ba0e1 · outbound
This paper cites an unresolved cited work.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Unresolved cited work
Reference 36
- Resolution
- unresolved
- raw_fallback, observed 2026-05-24T08:16:05.802923Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation c0ac92ee-31ef-4851-9c53-9b78238ea923 · outbound
This paper cites 1990 , publisher=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems 1990 , publisher=
Reference 37
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.843238Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation a87c0f4e-7d86-4c66-9209-f572c07f6730 · outbound
This paper cites 2004 , publisher=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems 2004 , publisher=
Reference 38
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.839930Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 1db13076-f34e-45f4-a440-264cb5714967 · outbound
This paper cites Naval Research Logistics (NRL) , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Naval Research Logistics (NRL) , volume=
Reference 39
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.741822Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 75359630-b527-4ad6-a106-0369d71e2ae0 · outbound
This paper cites International Journal of Operational Research , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems International Journal of Operational Research , volume=
Reference 40
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.744876Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 13acb7b9-897d-42d3-9fc9-d3f04c7df248 · outbound
This paper cites Information Processing Society of Japan Journal , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Information Processing Society of Japan Journal , volume=
Reference 41
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.774933Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 7df811b9-d2d3-4762-b368-137c56b59d1b · outbound
This paper cites an unresolved cited work.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Unresolved cited work
Reference 42
- Resolution
- unresolved
- raw_fallback, observed 2026-05-24T08:16:05.836502Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 2451eba5-0973-4c33-ac7b-bb9b58cf9169 · outbound
This paper cites Operations Research Letters , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Operations Research Letters , volume=
Reference 43
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.735081Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 12e8eee8-34d2-4a93-a0fb-d7ba7d5c3e80 · outbound
This paper cites Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX) , pages=
Reference 44
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.801533Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 39f3ce72-595b-4cb2-b41a-fcd827825ffc · outbound
This paper cites Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , pages=
Reference 45
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.797544Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation a50f4eaa-dc68-467f-b489-ddacf15a6151 · outbound
This paper cites Algorithmica , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Algorithmica , volume=
Reference 46
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.732384Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 9ca67012-49d6-42d8-9676-ddc93792319d · outbound
This paper cites Journal of Political Economy , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Journal of Political Economy , volume=
Reference 47
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.738705Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation ae57ac75-ba81-4a01-b3ed-5ec560fe8d29 · outbound
This paper cites Journal of the ACM , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Journal of the ACM , volume=
Reference 48
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.823131Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 68e0c591-0859-43ae-86f7-674180d773cc · outbound
This paper cites Proceedings of the 19th ACM Conference on Economics and Computation (EC) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 19th ACM Conference on Economics and Computation (EC) , pages=
Reference 49
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.751047Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 49e5ba56-311e-4f77-b709-9b5ba5375f6a · outbound
This paper cites Proceedings of the 21st ACM Conference on Economics and Computation (EC) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 21st ACM Conference on Economics and Computation (EC) , pages=
Reference 50
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.768810Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 204ae778-3bdf-42d2-8c2e-947b92ba2036 · outbound
This paper cites Proceedings of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 35th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=
Reference 51
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.819658Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 6099a6d2-1bca-4c0a-bc4d-c0c0d88d65f2 · outbound
This paper cites Doklady Akademii Nauk SSSR , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Doklady Akademii Nauk SSSR , volume=
Reference 52
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.728852Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation db6b93c3-64bb-4710-ae67-3f70d4034fe0 · outbound
This paper cites Proceedings of the 16th Annual ACM Symposium on Theory of Computing (STOC) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 16th Annual ACM Symposium on Theory of Computing (STOC) , pages=
Reference 53
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.725410Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation de626fc5-813d-41f5-9be3-f3dd66e69c11 · outbound
This paper cites an unresolved cited work.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Unresolved cited work
Reference 54
- Resolution
- unresolved
- raw_fallback, observed 2026-05-24T08:16:05.732710Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation a93b8cc1-c73b-4280-92e3-5625d4fafcb8 · outbound
This paper cites SIAM Journal on Computing , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems SIAM Journal on Computing , volume=
Reference 55
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.744001Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation c70117ae-b0e3-4b87-a6b6-aacafd432f47 · outbound
This paper cites SIAM Journal on Discrete Mathematics , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems SIAM Journal on Discrete Mathematics , volume=
Reference 56
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.755185Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation aa6e1bc5-560a-482c-b841-47cce5100a34 · outbound
This paper cites Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=
Reference 57
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.780570Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 97c8888e-76ae-41c8-9c64-d20b0c09fac6 · outbound
This paper cites Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC) , pages=
Reference 58
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.710625Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation d4ed710e-5949-4269-bf18-d506c19c4d64 · outbound
This paper cites European Journal of Operational Research , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems European Journal of Operational Research , volume=
Reference 59
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.714472Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 67d1cd2d-70d1-4815-a765-0620a29ff9f4 · outbound
This paper cites Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS) , pages=
Reference 60
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.793775Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation b91154b1-02fc-4183-8b1c-bffb3da5b2d5 · outbound
This paper cites Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More
Reference 61
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T14:56:08.326566Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation b1177f58-c2fa-42b3-b0a5-c248c87b7656 · outbound
This paper cites Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
Reference 62
- Resolution
- verified exact
- arxiv_id, observed 2026-07-04T23:44:41.973551Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation f7f91b7e-312f-4783-b255-57494f410aa8 · outbound
This paper cites ACM Transactions on Algorithms , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems ACM Transactions on Algorithms , volume=
Reference 63
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.706650Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 538fd514-3784-47b9-976b-534319adf1cc · outbound
This paper cites Information Processing Letters , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Information Processing Letters , volume=
Reference 64
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.789990Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation adfc77c5-f857-4cf8-b869-378d8b80ccec · outbound
This paper cites 1997 , publisher=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems 1997 , publisher=
Reference 65
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.783818Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 9927e12a-ea33-4300-b804-6647fd34a526 · outbound
This paper cites Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC) , pages=
Reference 66
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.769977Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation fbc1c676-e7e1-4335-b37a-3da1bbe535c8 · outbound
This paper cites Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX) , pages=
Reference 67
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.693793Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation bd798786-475d-46dd-b3dc-a2c06dccbb2a · outbound
This paper cites Journal of Heuristics , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Journal of Heuristics , volume=
Reference 68
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.826387Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 75e23e9e-b8aa-4a69-999a-244ce1c6d539 · outbound
This paper cites Journal of the ACM , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Journal of the ACM , volume=
Reference 69
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.816060Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 8bebd59b-bcc6-48bc-82ce-ade17d3430ec · outbound
This paper cites Journal of the ACM , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Journal of the ACM , volume=
Reference 70
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.710282Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 6b4fc74b-0e46-4ba2-8c8f-36f876004909 · outbound
This paper cites Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP) , year=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP) , year=
Reference 71
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.729175Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 8ba58aaa-98ff-40d6-a17e-68e9aca383a1 · outbound
This paper cites Mathematics of Operations Research , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Mathematics of Operations Research , volume=
Reference 72
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.765015Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 7bf68674-c947-4bd1-bbd4-b27cabced031 · outbound
This paper cites Journal of Combinatorial Optimization , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Journal of Combinatorial Optimization , volume=
Reference 73
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.696026Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 2336936f-7263-4e63-9a36-904e9b6f1af6 · outbound
This paper cites Proceedings of the 1st Symposium on Simplicity in Algorithms (SOSA) , year=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 1st Symposium on Simplicity in Algorithms (SOSA) , year=
Reference 74
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.796747Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 54a8bdb2-72ea-4129-bdce-20e53c7a2550 · outbound
This paper cites Algorithmica , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Algorithmica , volume=
Reference 75
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.685752Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation a5567192-2dd7-4cc4-bfcf-db3513dc2fd0 · outbound
This paper cites INFORMS Journal on Computing , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems INFORMS Journal on Computing , volume=
Reference 76
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.669819Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation f430a9d2-3c41-492a-a32a-037f8fcc69ec · outbound
This paper cites an unresolved cited work.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Unresolved cited work
Reference 77
- Resolution
- unresolved
- raw_fallback, observed 2026-05-24T08:16:05.663083Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation e4932e99-e2ec-4041-a48a-4ce9c5e82832 · outbound
This paper cites ACM SIGecom Exchanges , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems ACM SIGecom Exchanges , volume=
Reference 78
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.799591Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation d47e2d5c-da96-4eeb-9ee8-37042a51b344 · outbound
This paper cites Random Structures & Algorithms , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Random Structures & Algorithms , volume=
Reference 79
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.652922Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 8a2bec4d-956c-42ea-8024-3002650c4d0c · outbound
This paper cites Algorithmica , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Algorithmica , volume=
Reference 80
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.649403Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 9497eef0-27a0-4a26-bd63-acdc9d9f8a64 · outbound
This paper cites Combinatorica , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Combinatorica , volume=
Reference 81
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.656554Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 11cdad69-dc8e-4621-8e8d-518c6fcc926d · outbound
This paper cites Journal of Scheduling , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Journal of Scheduling , volume=
Reference 82
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.812843Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 8fc70e5b-26d7-4232-894b-535c1eef636c · outbound
This paper cites Mathematical Programming , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Mathematical Programming , volume=
Reference 83
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.647482Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 1d299da1-e6c3-400a-bdef-330797a8d3bf · outbound
This paper cites SIAM Journal on Discrete Mathematics , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems SIAM Journal on Discrete Mathematics , volume=
Reference 84
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.809902Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 774b18c4-61a8-4e03-8bb2-3ff678c92f16 · outbound
This paper cites Mathematics of Operations Research , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Mathematics of Operations Research , volume=
Reference 85
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.805633Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 7dc38f18-3843-46c1-baed-3b223fb9b104 · outbound
This paper cites Algorithmica , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Algorithmica , volume=
Reference 86
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.639467Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation a4ec97b5-56ee-4dea-a3e1-40f993a664da · outbound
This paper cites and Tardos, Eva , booktitle=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems and Tardos, Eva , booktitle=
Reference 87
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.646051Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 90b416cb-35fe-49a9-9eb0-4a19197e9daf · outbound
This paper cites Minkowski's Convex Body Theorem and Integer Programming , volume =.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Minkowski's Convex Body Theorem and Integer Programming , volume =
Reference 88
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.659758Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 248ca939-9239-4c95-b985-2837902fd4d9 · outbound
This paper cites Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS) , pages=
Reference 89
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.793405Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation e9f2b108-3742-4760-a910-5098b014741a · outbound
This paper cites Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI) , pages=
Reference 90
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.689174Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 4de1017a-6875-4001-80fe-c972b4edde13 · outbound
This paper cites Proceedings of the European Conference on Multi-Agent Systems (EUMAS) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the European Conference on Multi-Agent Systems (EUMAS) , pages=
Reference 91
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.816451Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 0d05e2d8-20ec-4cc6-866c-d78aac04bf18 · outbound
This paper cites Optimization Letters , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Optimization Letters , volume=
Reference 92
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.699681Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 758d91a0-24fc-4e46-93a9-96270fc10832 · outbound
This paper cites Theoretical Computer Science , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Theoretical Computer Science , volume=
Reference 93
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.810185Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 58c1400a-4b43-4882-b1e1-cea04a34638f · outbound
This paper cites Proceedings of the International Conference on Algorithms and Complexity (CIAC) , pages=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Proceedings of the International Conference on Algorithms and Complexity (CIAC) , pages=
Reference 94
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.619195Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 05d0f760-ad5b-4b2a-8faf-e268b0d37092 · outbound
This paper cites 2011 , publisher=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems 2011 , publisher=
Reference 95
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.626616Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 19ccd3ac-fdc5-4bdc-9ad5-4ac30862712b · outbound
This paper cites Journal of the ACM (JACM) , volume=.
Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems Journal of the ACM (JACM) , volume=
Reference 96
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-24T08:16:05.632782Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Pith citing papers
No inbound Pith citation observations are available.