For two agents with additive valuations, the answer is yes

we can round a connected envy-free cake-cutting (e.g., found by divide and choose).

Open the “Contiguous EF1 allocation” section on Wikipedia →

Source: List of unsolved problems in fair division (CC BY-SA 4.0)