In the classical NP-hard (metric) 𝑘-median problem, we are given a set of 𝑛 clients and centers with metric distances between them, along with an integer parameter 𝑘 ≥ 1. The objective is to select a subset of 𝑘 open centers that minimizes the total distance from each client to its closest open center. In their seminal work, Jain, Mahdian, Markakis, Saberi, and Vazirani presented the Greedy algorithm for facility location, which implies a 2-approximation algorithm for 𝑘-median that opens 𝑘 centers in expectation. Since then, substantial research has aimed at narrowing the gap between their algorithm and the best achievable approximation by an algorithm guaranteed to open exactly 𝑘 centers, as required in the 𝑘-median problem. During the last decade, all improvements have been achieved by leveraging their algorithm (or a small improvement thereof), followed by a second step called bi-point rounding, which inherently adds an additional factor to the approximation guarantee. Our main result closes this gap: for any 𝜀 > 0, we present a (2 +𝜀)-approximation algorithm for the 𝑘-median problem, improving the previous best known approximation factor of 2.613. Our approach builds on a combination of two key algorithms. First, we present a non-trivial modification of the Greedy algorithm that operates with only 𝑂(log𝑛/𝜀2) adaptive phases. Through a novel walkbetween-solutions approach, this enables us to construct a (2 + 𝜀)-approximation algorithm for 𝑘-median that consistently opens at most 𝑘 +𝑂(log𝑛/𝜀2) centers: via known results, this already implies a (2 + 𝜀)-approximation algorithm that runs in quasi-polynomial time. Second, we develop a novel (2 + 𝜀)-approximation algorithm tailored for stable instances, where removing any center from an optimal solution increases the cost by at least an Ω(𝜀3/log𝑛) fraction. Achieving this involves several ideas, including a sampling approach inspired by the 𝑘-means++ algorithm and a reduction to submodular optimization subject to a partition matroid. This allows us to convert the previous result into a polynomial time algorithm that opens exactly 𝑘 centers while maintaining the (2+𝜀)-approximation guarantee.