Fetching the paper…
Reading the bibliography…
The design of a good algorithm to solve NP-hard combinatorial approximation problems requires specific domain knowledge about the problems and often needs a trial-and-error problem solving approach.
A graph coloring algorithm for large scheduling problems
F. Leighton · 1979
Earlier work this paper cites.
New methods to color the vertices of a graph
D. Brélaz · 1979
Earlier work this paper cites.
On the computational complexity of ising spin glass models
F. Barahona et al · 1982
Earlier work this paper cites.
Computers and intractability: A guide to the theory of npcompletness
M. Garey et al · 1982
Earlier work this paper cites.
Backtrack: An o(1) expected time algorithm for the graph coloring problem
Herbert S. Wilf · 1984
Earlier work this paper cites.
A software package for sequential quadratic programming, dlr german aerospace center-institute for flight mechanics
D. Kraft · 1988
Earlier work this paper cites.
Rapid solutions of problems by quantum computation
David Deutsch and Richard Jozsa · 1992
Earlier work this paper cites.
A direct search optimization method that models the objective and constraint functions by linear interpolation
S. Gomez and J.-P. Hennart · 1994
Earlier work this paper cites.
A limited memory algorithm for bound constrained optimization
Nocedal J. Byrd R. H., Lu P. and C. Zhu · 1995
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
K. Grover · 1996
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
P. W. Shor · 1997
Earlier work this paper cites.
It is hard to know when greedy is good for finding independent sets
H. L. Bodlaender et al · 1997
Earlier work this paper cites.
Statistical mechanics, three-dimensionality and np-completeness: I. universality of intracatability for the partition function of the ising model across non-planar surfaces (extended abstract)
Sorin Istrail · 2000
Earlier work this paper cites.
Frequency planning and ramifications of coloring
M. Grotschel et al · 2000
Earlier work this paper cites.
Online frequency assignment in wireless communication networks
Y. L. Chin · 2007
Cited alongside, same era.
A memetic algorithm for graph coloring
J.-K. Lü, Z.and Hao · 2010
Cited alongside, same era.
Quantum Computation and Quantum Information: 10th Anniversary Edition
Michael A. Nielsen and Isaac L. Chuang · 2011
Cited alongside, same era.
Explorations in Quantum Computing
C. P. Williams · 2011
Cited alongside, same era.
Acyclic and star colorings of cographs
A. Lyons · 2011
Cited alongside, same era.
Greedy algorithms for dynamic graph coloring
L. Ouerfelli and H. Bouziri · 2011
Cited alongside, same era.
Colorings of plane graphs: A survey
E-learning approach of the graph coloring problem applied to register allocation in embedded systems
A. Florea and A. Gellert · 2016
Later among the works it cites.
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
A. Kandala et al · 2017
Later among the works it cites.
Quantum computing in the nisq era and beyond
J. Preskill · 2018
Later among the works it cites.
What would you do with 1000 qubits?
D. Morello, A. Reilly · 2018
Later among the works it cites.
Quantum optimization using variational algorithms on near-term quantum devices
Nikolaj Moll et al · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Borodin O · 2013
Cited alongside, same era.
A variational eigenvalue solver on a photonic quantum processor
A. Peruzzo et al · 2014
Cited alongside, same era.
The unconstrained binary quadratic programming problem: A survey, kochenberger
G. Hao et al · 2014
Cited alongside, same era.
Ising formulations of many np problems
A. Lucas · 2014
Cited alongside, same era.
The airport gate assignment problem: A survey
B. Abdelghani et al · 2014
Cited alongside, same era.
A mobile frequency allocation algorithm based on the graph theory
L. Yang and Y. H. Yu · 2015
Cited alongside, same era.
F. Glover and G. Kochenberger · 2018
Later among the works it cites.
Register allocation for intel processor graphics
Wei-Yu Chen et al · 2018
Later among the works it cites.
An improved implementation approach for quantum phase estimation on quantum computers
Hamed Mohammadbagherpoor, Young-Hyun Oh, Patrick Dreher, Xianqing Singh, Anand Yu, and Andy J. Rindos · 2019
Closest in time.
Quantum algorithms for mixed binary optimization applied to transaction settlement
Lee Braine, Daniel J. Egger, Jennifer Glick, and Stefan Woerner · 2019
Closest in time.
Accelerated variational quantum eigensolver
Daochen Wang et al · 2019
Closest in time.
Qiskit: An open-source framework for quantum computing, 2019
Héctor Abraham et al · 2019
Closest in time.
Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz
J. Romero et al · 2058
Closest in time.
Study on an airport gate reassignment method and its application
Wu Deng et al · 2073
Closest in time.