  We propose an online heuristic algorithm for the problem of network slice
placement optimization. The solution is adapted to support placement on large
scale networks and integrates Edge-specific and URLLC constraints. We rely on
an approach called the Power of Two Choices to build the heuristic. The
evaluation results show the good performance of the heuristic that solves the
problem in few seconds under a large scale scenario. The heuristic also
improves the acceptance ratio of network slice placement requests when compared
against a deterministic online Integer Linear Programming (ILP) solution.
