Quantum speedup for the minimum Steiner tree problem

DOI10.1007/978-3-030-58150-3_19MaRDI QIDQ2019462zbMATH OpenOpenAlexFDO

Authors Masayuki Miyamoto, Masakazu Iwamura, Koichi Kise, François Le Gall

Publication date 21 April 2021

Full work available at URL https://arxiv.org/abs/1904.03581

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cited in

(3)

• Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs
• Quantum algorithms for one-sided crossing minimization
• Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems

This page was built for publication: Quantum speedup for the minimum Steiner tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019462)