Decomposition-based QAOA with spectral graph cuts and GSR merging solves large satellite MCLP instances with competitive coverage and bounded qubit use where standard QAOA is infeasible.
Algebraic connectivity of graphs,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design
Decomposition-based QAOA with spectral graph cuts and GSR merging solves large satellite MCLP instances with competitive coverage and bounded qubit use where standard QAOA is infeasible.