Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4, p. 39 — a T-path optimal for the scaled costs ⌊c_ij(n − 1)/εLB⌋ is longer than any T-path by at most εLB

Proved
HassinRSP.Rounding.scaled_opt_error

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-schemep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1restricted-shortest-pathrounding-and-scaling

Consider an instance of the restricted shortest path problem (vertices 1,…,n1,\dots,n1,…,n, n≥2n\ge2n≥2, edges (i,j)(i,j)(i,j) with i<ji<ji<j, positive integer lengths and transition times), a time budget TTT, ε>0\varepsilon>0ε>0 and LB>0LB>0LB>0. Let ppp be a TTT-path that is optimal for the scaled lengths

c~ij=⌊cij(n−1)εLB⌋,\tilde c_{ij}=\Big\lfloor\frac{c_{ij}(n-1)}{\varepsilon LB}\Big\rfloor ,c~ij​=⌊εLBcij​(n−1)​⌋,

i.e. ∑(i,j)∈pc~ij≤∑(i,j)∈qc~ij\sum_{(i,j)\in p}\tilde c_{ij}\le\sum_{(i,j)\in q}\tilde c_{ij}∑(i,j)∈p​c~ij​≤∑(i,j)∈q​c~ij​ for every TTT-path qqq (Step 2 of the Rounding Algorithm). Then every TTT-path qqq satisfies

c(p)≤c(q)+ε LB.c(p)\le c(q)+\varepsilon\,LB .c(p)≤c(q)+εLB.

This is the paper's "an ε\varepsilonε-approximation can be obtained by applying Algorithm B to the scaled costs ⌊cij/(LBε/(n−1))⌋\lfloor c_{ij}/(LB\varepsilon/(n-1))\rfloor⌊cij​/(LBε/(n−1))⌋. The error introduced is at most εLB\varepsilon LBεLB". Combined with LB≤LB\leLB≤ OPT it gives the approximation ratio 1+ε1+\varepsilon1+ε.

Formalization Note. The estimate holds for any LB>0LB>0LB>0; the hypothesis that LB is a lower bound on OPT is only needed to turn the additive error into the ratio and is not part of this statement. The upper bound ε<1\varepsilon<1ε<1 is omitted as unused. The paper's "εLB<εOPT\varepsilon LB<\varepsilon OPTεLB<εOPT" is not formalized here; with LB === OPT possible it holds only as ≤\le≤.

Preamble
import Mathlib
import Definitions.Def_HassinRSP_Rounding_Setting
Formal statement
namespace HassinRSP.Rounding

theorem scaled_opt_error (I : Instance) (hI : I.WellFormed) (T : ℕ) (ε : ℝ) (hε0 : 0 < ε)
    (LB : ℝ) (hLB : 0 < LB) (p : List ℕ) (hp : IsRoundingOutput I T ε LB p) :
    ∀ q, IsTPath I T q → (pathLen I p : ℝ) ≤ pathLen I q + ε * LB := by sorry

end HassinRSP.Rounding
Source
Hassin, Approximation schemes for the restricted shortest path problem, Math. Oper. Res. 17 (1992), p. 39, §4, second paragraph and Rounding Algorithm Step 2
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me