Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth | Paper Citation Record

Observation 8dcecc53-8fbf-42ef-8323-b63debe78c90 · outbound

This paper cites Applegate, Robert E.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Applegate, Robert E

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:49.179156Z

Source-reported events for the cited work

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

Observation ce65b63a-9e06-4d64-91df-d0f735247999 · outbound

This paper cites Applegate, Robert E.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Applegate, Robert E

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:49.116448Z

Source-reported events for the cited work

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

Observation a9af2a88-2ed0-4b33-8a2f-804ea843af4a · outbound

This paper cites Beating approximation factor two for weighted tree augmentation with bounded costs.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Beating approximation factor two for weighted tree augmentation with bounded costs

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.999450Z

Source-reported events for the cited work

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

Observation aa939562-08bf-49e8-a760-18c6314c5f8f · outbound

This paper cites The multiplicative weights update method: a meta-algorithm and applications.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth The multiplicative weights update method: a meta-algorithm and applications

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.984274Z

Source-reported events for the cited work

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

Observation 535719b7-1def-43a1-82f7-cc77ce0529c3 · outbound

This paper cites Stateless distributed gradient descent for positive linear programs.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Stateless distributed gradient descent for positive linear programs

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.969089Z

Source-reported events for the cited work

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

Observation 6566c07b-daaf-4820-ac38-b43d6f00b682 · outbound

This paper cites Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.837787Z

Source-reported events for the cited work

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

Observation e8972225-78a1-4809-8127-45c5064df840 · outbound

This paper cites Atallah and Uzi Vishkin.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Atallah and Uzi Vishkin

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.820824Z

Source-reported events for the cited work

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

Observation 38246805-31a4-4f56-aa63-50f30c264aea · outbound

This paper cites Using optimization to break the epsilon barrier: A faster and simpler width-independent algorithm for solving positive linear programs in parallel.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Using optimization to break the epsilon barrier: A faster and simpler width-independent algorithm for solving positive linear programs in parallel

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.802010Z

Source-reported events for the cited work

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

Observation c081ff35-af96-42c9-8503-bebacb05beb8 · outbound

This paper cites Nearly-linear time positive lp solver with faster convergence rate.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Nearly-linear time positive lp solver with faster convergence rate

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.698665Z

Source-reported events for the cited work

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

Observation e99e21a4-f26b-44db-8371-0871c46919df · outbound

This paper cites Byers, and Danny Raz.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Byers, and Danny Raz

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.602464Z

Source-reported events for the cited work

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

Observation 5b638970-468b-4d7d-89ba-14243c3e6119 · outbound

This paper cites Byers, and Danny Raz.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Byers, and Danny Raz

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.531815Z

Source-reported events for the cited work

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

Observation d2d5d906-262b-4e3f-bf0c-6f6d4151285f · outbound

This paper cites Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.464415Z

Source-reported events for the cited work

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

Observation bfd509c4-c36e-4f6b-917a-476c191e830c · outbound

This paper cites Minimum weight 2-edge-connected spanning subgraphs in planar graphs.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Minimum weight 2-edge-connected spanning subgraphs in planar graphs

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.447792Z

Source-reported events for the cited work

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

Observation 21df0db4-43e9-4926-b8d5-4aff6393a332 · outbound

This paper cites Blelloch.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Blelloch

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.333986Z

Source-reported events for the cited work

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

Observation f47f549d-2819-4d16-aecb-3783faf1f1af · outbound

This paper cites A simple algorithm for minimum cuts in near-linear time.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth A simple algorithm for minimum cuts in near-linear time

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.315460Z

Source-reported events for the cited work

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

Observation 38227f7c-2bc2-471a-9003-686732739e60 · outbound

This paper cites Survivable network design for group connectivity in low-treewidth graphs.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Survivable network design for group connectivity in low-treewidth graphs

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.206511Z

Source-reported events for the cited work

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

Observation fde8a394-b509-4e71-8523-991939f9c76f · outbound

This paper cites Carr, Lisa Fleischer, Vitus J.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Carr, Lisa Fleischer, Vitus J

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.190355Z

Source-reported events for the cited work

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

Observation 77fed510-49b3-4165-9536-9a088b0b6f9b · outbound

This paper cites Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.174474Z

Source-reported events for the cited work

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

Observation 039a3900-2598-41ed-bb62-efa46eee9afe · outbound

This paper cites Approximating k-edge-connected spanning subgraphs via a near-linear time LP solver.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Approximating k-edge-connected spanning subgraphs via a near-linear time LP solver

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:48.075544Z

Source-reported events for the cited work

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

Observation e5a9cd2b-e410-41c3-963a-6e568487ee8e · outbound

This paper cites Worst-case analysis of a new heuristic for the traveling salesman.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Worst-case analysis of a new heuristic for the traveling salesman

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.961133Z

Source-reported events for the cited work

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

Observation 225250e7-4472-487d-bf9a-e9a6467693e5 · outbound

This paper cites Approximability of dense and sparse instances of minimum 2-connectivity, tsp and path problems.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Approximability of dense and sparse instances of minimum 2-connectivity, tsp and path problems

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.940966Z

Source-reported events for the cited work

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

Observation aab1057d-8b10-4705-87b7-fc2c602c7108 · outbound

This paper cites On approximability of the minimum-cost k-connected spanning subgraph problem.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth On approximability of the minimum-cost k-connected spanning subgraph problem

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.922898Z

Source-reported events for the cited work

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

Observation c436f361-556e-4f12-b474-146fc64bbcda · outbound

This paper cites Fast approximation schemes for euclidean multi-connectivity problems.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Fast approximation schemes for euclidean multi-connectivity problems

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.807578Z

Source-reported events for the cited work

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

Observation 8a1ca8e6-fe28-4535-a11b-64f20a185396 · outbound

This paper cites Carr and Giuseppe Lancia.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Carr and Giuseppe Lancia

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.791699Z

Source-reported events for the cited work

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

Observation 4c0acbff-718c-438d-86f1-0cc8fae58343 · outbound

This paper cites an unresolved cited work.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Unresolved cited work

Reference 25

Resolution: unresolved; raw_fallback, observed 2026-08-12T15:08:47.718410Z

Source-reported events for the cited work

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

Observation 74186e5b-571d-4075-b5c8-64edad099f41 · outbound

This paper cites Approximating the H eld- K arp bound for metric TSP in nearly-linear time.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Approximating the H eld- K arp bound for metric TSP in nearly-linear time

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.648388Z

Source-reported events for the cited work

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

Observation 792a9b17-d375-4239-9bfc-f59f1b4a5f4b · outbound

This paper cites Fast Approximations for Metric-TSP via Linear Programming.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Fast Approximations for Metric-TSP via Linear Programming

Reference 27

Resolution: verified exact; local_arxiv, observed 2026-08-12T15:08:45.174800Z

Source-reported events for the cited work

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

Observation 5c83f783-43f5-4387-8e0f-71287dfccbd4 · outbound

This paper cites Dantzig, D.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Dantzig, D

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.530853Z

Source-reported events for the cited work

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

Observation 72556bb4-1fda-437b-8486-8fb4aa140c3b · outbound

This paper cites A better approximation ratio for the minimum sizek-edge-connected spanning subgraph problem.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth A better approximation ratio for the minimum sizek-edge-connected spanning subgraph problem

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.450865Z

Source-reported events for the cited work

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

Observation e4911ca9-0a8d-4d5b-b39f-f2ca7e2e8ffc · outbound

This paper cites Approximating weighted tree augmentation via chv \'a tal-gomory cuts.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Approximating weighted tree augmentation via chv \'a tal-gomory cuts

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.434358Z

Source-reported events for the cited work

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

Observation 6031cffe-5b4d-4ad3-a15f-0316f99e22ba · outbound

This paper cites Davenport-schinzel theory of matrices.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Davenport-schinzel theory of matrices

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.275661Z

Source-reported events for the cited work

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

Observation 7af28d23-ceab-4583-8b41-da9ec01f43b6 · outbound

This paper cites Frederickson and Joseph J \' a J \' a.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Frederickson and Joseph J \' a J \' a

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.259544Z

Source-reported events for the cited work

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

Observation e348c1f2-3759-4f3f-a4f9-2bbc4a5f845f · outbound

This paper cites Frederickson and Joseph F.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Frederickson and Joseph F

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.210290Z

Source-reported events for the cited work

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

Observation 6679a3f4-bef8-4a36-b1ac-28d725487a74 · outbound

This paper cites Approximating fractional multicommodity flow independent of the number of commodities.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Approximating fractional multicommodity flow independent of the number of commodities

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.141592Z

Source-reported events for the cited work

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

Observation 314aefce-7d95-4196-9bf5-473a5f220f02 · outbound

This paper cites Goemans and Dimitris Bertsimas.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Goemans and Dimitris Bertsimas

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.125856Z

Source-reported events for the cited work

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

Observation a827a0cb-37f7-492c-9e55-22bd5d9f6202 · outbound

This paper cites Parallel minimum cuts in near-linear work and low depth.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Parallel minimum cuts in near-linear work and low depth

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.052708Z

Source-reported events for the cited work

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

Observation 7f276d6f-b67b-4fb7-a7ce-f90c7518ac88 · outbound

This paper cites Approximating the smallest k-edge connected spanning subgraph by lp-rounding.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Approximating the smallest k-edge connected spanning subgraph by lp-rounding

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.038999Z

Source-reported events for the cited work

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

Observation d7827dee-4bbd-419e-8f74-02422392107c · outbound

This paper cites Faster and simpler algorithms for multicommodity flow and other fractional packing problems.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Faster and simpler algorithms for multicommodity flow and other fractional packing problems

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:47.023120Z

Source-reported events for the cited work

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

Observation 29cb2017-9f72-4206-97ca-28340407db9a · outbound

This paper cites From trees to polynomials and back again: New capacity bounds with applications to TSP.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth From trees to polynomials and back again: New capacity bounds with applications to TSP

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.935204Z

Source-reported events for the cited work

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

Observation 0f3c8c6b-9479-4dbb-84f4-bfb163d331ad · outbound

This paper cites Improved approximation for tree augmentation: saving by rewiring.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Improved approximation for tree augmentation: saving by rewiring

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.920315Z

Source-reported events for the cited work

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

Observation 9ba02888-eb91-4029-89a8-5e7dbbe7ac2d · outbound

This paper cites A note on a recent algorithm for minimum cut.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth A note on a recent algorithm for minimum cut

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.779262Z

Source-reported events for the cited work

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

Observation ce31a20c-7da8-41eb-91aa-8ab70eea8066 · outbound

This paper cites an unresolved cited work.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Unresolved cited work

Reference 42

Resolution: unresolved; raw_fallback, observed 2026-08-12T15:08:46.709724Z

Source-reported events for the cited work

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

Observation 9a3056fe-058a-468e-a412-ea10692f2af0 · outbound

This paper cites an unresolved cited work.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Unresolved cited work

Reference 43

Resolution: unresolved; raw_fallback, observed 2026-08-12T15:08:46.628269Z

Source-reported events for the cited work

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

Observation 9d7278ce-573c-41e4-9ea2-7518bb17fd0b · outbound

This paper cites an unresolved cited work.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Unresolved cited work

Reference 44

Resolution: unresolved; raw_fallback, observed 2026-08-12T15:08:46.549131Z

Source-reported events for the cited work

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

Observation e14e1e07-2188-4f2e-93ff-91a05c1b341f · outbound

This paper cites Ellis Hershkowitz, Nathan Klein, and Rico Zenklusen.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Ellis Hershkowitz, Nathan Klein, and Rico Zenklusen

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.533293Z

Source-reported events for the cited work

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

Observation 825ec26f-b63f-43ad-8aba-a0e5919feca7 · outbound

This paper cites Deterministic near-linear time minimum cut in weighted graphs.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Deterministic near-linear time minimum cut in weighted graphs

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.483161Z

Source-reported events for the cited work

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

Observation d7ffd659-1ed0-4387-a10a-0e81d001e39d · outbound

This paper cites Williamson.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Williamson

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.378514Z

Source-reported events for the cited work

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

Observation 35fa05fc-b338-4017-b038-44bd89a1d432 · outbound

This paper cites an unresolved cited work.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Unresolved cited work

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-12T15:08:44.379880Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 27f10c6a-9136-4302-95e3-dfb1486746af · outbound

This paper cites Lagrangian relaxation based algorithms for convex programming problems.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Lagrangian relaxation based algorithms for convex programming problems

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.353348Z

Source-reported events for the cited work

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

Observation ad8c95bc-15c6-4dca-8548-4d502892d392 · outbound

This paper cites Karlin, Nathan Klein, Shayan Oveis Gharan, and Xinzhi Zhang.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Karlin, Nathan Klein, Shayan Oveis Gharan, and Xinzhi Zhang

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.286351Z

Source-reported events for the cited work

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

Observation f9838851-0163-4fbe-9c9d-82504a8e5d5f · outbound

This paper cites Karlin, Nathan Klein, and Shayan Oveis Gharan.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Karlin, Nathan Klein, and Shayan Oveis Gharan

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.272277Z

Source-reported events for the cited work

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

Observation 85a37226-7f2a-4445-b5db-48a545313d56 · outbound

This paper cites Karlin, Nathan Klein, and Shayan Oveis Gharan.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Karlin, Nathan Klein, and Shayan Oveis Gharan

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.212411Z

Source-reported events for the cited work

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

Observation 14afd8e3-9489-4717-8002-7fd9faedd336 · outbound

This paper cites Biconnectivity approximations and graph carvings.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Biconnectivity approximations and graph carvings

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.197763Z

Source-reported events for the cited work

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

Observation 84f0cc49-d04f-48b7-8aa9-51d7e9e87b10 · outbound

This paper cites Improved inapproximability for TSP.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Improved inapproximability for TSP

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.182591Z

Source-reported events for the cited work

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

Observation 1ced05c9-dfb2-41b3-8c2d-84b870738f93 · outbound

This paper cites A rounding by sampling approach to the minimum size k-arc connected subgraph problem.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth A rounding by sampling approach to the minimum size k-arc connected subgraph problem

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.117365Z

Source-reported events for the cited work

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

Observation ee75f117-87c6-433f-8115-9a808a912a30 · outbound

This paper cites an unresolved cited work.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Unresolved cited work

Reference 56

Resolution: unresolved; raw_fallback, observed 2026-08-12T15:08:46.099712Z

Source-reported events for the cited work

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

Observation 1440bbd7-f0c5-42e1-ab79-b5995cd26954 · outbound

This paper cites Work-optimal parallel minimum cuts for non-sparse graphs.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Work-optimal parallel minimum cuts for non-sparse graphs

Reference 57

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.083311Z

Source-reported events for the cited work

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

Observation 01bb4fcc-3d3c-4265-81f9-c6c2d21dbca7 · outbound

This paper cites A parallel approximation algorithm for positive linear programming.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth A parallel approximation algorithm for positive linear programming

Reference 58

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:46.003439Z

Source-reported events for the cited work

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

Observation d35a1e82-b3b5-44d9-84ed-6dc769419f3e · outbound

This paper cites an unresolved cited work.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Unresolved cited work

Reference 59

Resolution: unresolved; raw_fallback, observed 2026-08-12T15:08:45.987387Z

Source-reported events for the cited work

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

Observation aaf4bc28-f100-421d-b595-d6464dba1d6c · outbound

This paper cites Monma, Beth Spellman Munson, and William R.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Monma, Beth Spellman Munson, and William R

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:45.889092Z

Source-reported events for the cited work

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

Observation 78bf664c-e5a6-4307-879d-23c760ec9874 · outbound

This paper cites Weighted min-cut: sequential, cut-query, and streaming algorithms.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Weighted min-cut: sequential, cut-query, and streaming algorithms

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:45.872352Z

Source-reported events for the cited work

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

Observation 9dd7b318-518e-4172-9fd0-40d7dc3878c7 · outbound

This paper cites Mahoney, Satish Rao, Di Wang, and Peng Zhang.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Mahoney, Satish Rao, Di Wang, and Peng Zhang

Reference 62

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:45.672217Z

Source-reported events for the cited work

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

Observation 8512d780-4bf1-4671-85ea-b1eedd158274 · outbound

This paper cites Nesterov.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Nesterov

Reference 63

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:45.657212Z

Source-reported events for the cited work

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

Observation 7bf3fc4a-92f4-41c9-8bf0-45875d04f2b7 · outbound

This paper cites Polyhedral structure of submodular and posi-modular systems.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Polyhedral structure of submodular and posi-modular systems

Reference 64

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:45.640741Z

Source-reported events for the cited work

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

Observation 033a9aa5-3eca-4b10-b84a-f4cf8e9c5227 · outbound

This paper cites an unresolved cited work.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Unresolved cited work

Reference 65

Resolution: unresolved; no resolver link, observed 2026-08-12T15:08:44.891694Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1c80e390-811d-4584-b4a9-560675d3f477 · outbound

This paper cites k-edge-connectivity: Approximation and LP relaxation.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth k-edge-connectivity: Approximation and LP relaxation

Reference 66

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:45.524196Z

Source-reported events for the cited work

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

Observation 4af0b868-327b-4086-ad2f-0ecbf93c7b98 · outbound

This paper cites Plotkin, David B.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Plotkin, David B

Reference 67

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:45.506977Z

Source-reported events for the cited work

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

Observation 53b4f613-4c8c-49db-9dda-7b85ddfa60d2 · outbound

This paper cites an unresolved cited work.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Unresolved cited work

Reference 68

Resolution: unresolved; raw_fallback, observed 2026-08-12T15:08:45.419189Z

Source-reported events for the cited work

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

Observation 6bdab757-df7d-436d-908b-0145c33556b0 · outbound

This paper cites An o(n \( ^2 \) log n) parallel MAX-FLOW algorithm.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth An o(n \( ^2 \) log n) parallel MAX-FLOW algorithm

Reference 69

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:45.379936Z

Source-reported events for the cited work

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

Observation 53c4b68c-8ab1-4a63-ae38-fe157d54987c · outbound

This paper cites Shmoys and David P.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Shmoys and David P

Reference 70

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:08:45.279259Z

Source-reported events for the cited work

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

Observation 26dd63ed-1a86-43ef-8059-1339de70da2f · outbound

This paper cites an unresolved cited work.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Unresolved cited work

Reference 71

Resolution: unresolved; raw_fallback, observed 2026-08-12T15:08:45.265021Z

Source-reported events for the cited work

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

Observation ecc7ddd3-ebd6-4cfb-839d-d36421724cf8 · outbound

This paper cites an unresolved cited work.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Unresolved cited work

Reference 72

Resolution: unresolved; raw_fallback, observed 2026-08-12T15:08:45.242480Z

Source-reported events for the cited work

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

Observation e095076e-c8d7-4746-9454-30e97075095c · outbound

This paper cites Nearly Linear-Work Algorithms for Mixed Packing/Covering and Facility-Location Linear Programs.

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth Nearly Linear-Work Algorithms for Mixed Packing/Covering and Facility-Location Linear Programs

Reference 73

Resolution: verified exact; local_arxiv, observed 2026-08-12T15:08:45.151752Z

Source-reported events for the cited work

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

Coverage vector

Reference resolution

Outbound references

Pith citing papers