A method is disclosed for determining a minimum connected dominating set in a graph, the method comprising obtaining an indication of an input graph, the input graph comprising a plurality of nodes and a plurality of edges; generating a distance table comprising for each node of the input graph, an indication of a distance between the given node and each of the other node of the plurality of nodes; generating a corresponding constrained binary quadratic programming problem using the generated distance table; providing the corresponding constrained binary quadratic programming problem to a quantum annealing solver; obtaining at least one approximate solution from the quantum annealing solver; post-processing the at least one approximate solution and providing the post-processed at least one approximate solution.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method for determining a minimum connected dominating set in a graph, the method comprising: obtaining an indication of an input graph, the input graph comprising a plurality of nodes and a plurality of edges; generating a distance table comprising for each node of the input graph, an indication of a distance between the given node and each of the other node of the plurality of nodes; generating a corresponding constrained binary quadratic programming problem using the generated distance table; providing the corresponding constrained binary quadratic programming problem to a quantum annealing solver; obtaining at least one approximate solution from the quantum annealing solver; post-processing the at least one approximate solution; and providing the post-processed at least one approximate solution. 2. The method as claimed in claim 1, wherein the quantum annealing solver is an unconstrained quantum annealing solver; further wherein the providing of the corresponding constrained binary quadratic programming problem comprises: generating an unconstrained binary quadratic programming problem using the generated constrained binary quadratic programming problem; and providing the generated unconstrained binary quadratic programming problem to the unconstrained quantum annealing solver; and further wherein the at least one approximate solution is obtained from the unconstrained quantum annealing solver. 3. The method as claimed in claim 1, wherein the quantum annealing solver is a constrained quantum annealing solver; wherein the providing of the corresponding constrained binary quadratic programming problem comprises: obtaining a corresponding solver subroutine; and solving the generated constrained binary quadratic programming problem using the solver subroutine; further wherein the at least one approximate solution is obtained from the solver subroutine. 4. A method for determining a minimum connected dominating set in a graph, the method comprising: obtaining an indication of an input graph, the input graph comprising a plurality of nodes and a plurality of edges; obtaining an indication of a solver to use for determining a minimum connected dominating set; generating a distance table comprising for each node of the input graph, an indication of a distance between the given node and each of the other node of the plurality of nodes; generating a corresponding constrained binary quadratic programming problem using the generated distance table; if the indication of a solver comprises an unconstrained quantum annealing solver: generating an unconstrained binary quadratic programming problem using the generated constrained binary quadratic programming problem, providing the unconstrained binary quadratic programming problem to the unconstrained quantum annealing solver, obtaining at least one approximate solution from the unconstrained quantum annealing solver, if the indication of a solver comprises a constrained quantum annealing solver: obtaining a corresponding solver subroutine, solving the generated constrained binary quadratic programming problem using the solver subroutine, and obtaining at least one approximate solution from the solver subroutine, post-processing the at least one approximate solution; and providing the post-processed at least one approximate solution. 5. The method as claimed in claim 1, wherein the indication of an input graph is obtained from at least one of a user interacting with a digital computer, a computer operatively connected to the digital computer, a software package, and an intelligent agent. 6. The method as claimed in claim 1, wherein the post-processed at least one approximate solution is provided to at least one of a user interacting with a digital computer, a computer operatively connected to the digital computer, a software package, and an intelligent agent. 7. A non-transitory computer-readable storage medium for storing computer-executable instructions which, when executed, cause a digital computer to perform a method for determining a minimum connected dominating set in a graph, the method comprising: obtaining an indication of an input graph, the input graph comprising a plurality of nodes and a plurality of edges; generating a distance table comprising for each node of the input graph, an indication of a distance between the given node and each of the other node of the plurality of nodes; generating a corresponding constrained binary quadratic programming problem using the generated distance table; providing the corresponding constrained binary quadratic programming problem to a quantum annealing solver; obtaining at least one approximate solution from the quantum annealing solver; post-processing the at least one approximate solution; and providing the post-processed at least one approximate solution. 8. A digital computer comprising: a central processing unit; a display device; a communication port for operatively connecting the digital computer to a quantum annealing solver; a memory unit comprising an application for determining a minimum connected dominating set problem, the application comprising: instructions for obtaining an indication of an input graph, the input graph comprising a plurality of nodes and a plurality of edges; instructions for generating a distance table comprising for each node of the input graph, an indication of a distance between the given node and each of the other node of the plurality of nodes; instructions for generating a corresponding constrained binary quadratic programming problem using the generated distance table; instructions for providing the corresponding constrained binary quadratic programming problem to a quantum annealing solver; instructions for obtaining at least one approximate solution from the quantum annealing solver; instructions for post-processing the at least one approximate solution; and instructions for providing the post-processed at least one approximate solution; and a data bus for interconnecting the central processing unit, the display device, the communication port, and the memory unit. 9. A method for determining a minimum connected dominating set in a graph, the method comprising: use of a processing unit for obtaining an indication of an input graph, the input graph comprising a plurality of nodes and a plurality of edges; use of a processing unit generating a distance table comprising for each node of the input graph, an indication of a distance between the given node and each of the other node of the plurality of nodes; use of a processing unit generating a corresponding constrained binary quadratic programming problem using the generated distance table; use of a processing unit providing the corresponding constrained binary quadratic programming problem to a quantum annealing solver; use of a processing unit obtaining at least one approximate solution from the quantum annealing solver; use of a processing unit post-processing the at least one approximate solution; and use of a processing unit providing the post-processed at least one approximate solution.