On the public citation graph

A Slack-Free Parametric HOBO Approach for Efficient Quantum Influence Maximization

https://doi.org/10.2139/ssrn.5817772
0 signed · 27 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.21751openalex-snapshot
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis
inferredcites →https://doi.org/10.1007/978-981-13-3143-5_35openalex-snapshot
A Survey on Information Diffusion Models in Social Networks
inferredcites →https://doi.org/10.1007/bf01343193openalex-snapshot
Beweis des Adiabatensatzes
inferredcites →https://doi.org/10.1007/s10479-022-04634-2openalex-snapshot
Quantum bridge analytics I: a tutorial on formulating and using QUBO models
inferredcites →https://doi.org/10.1007/s43762-022-00070-xopenalex-snapshot
Using quantum computing to solve the maximal covering location problem
inferredcites →https://doi.org/10.1016/0377-2217(94)00159-6openalex-snapshot
A Lagrangean heuristic for the maximal covering location problem
inferredcites →https://doi.org/10.1016/j.disopt.2020.100594openalex-snapshot
Penalty and partitioning techniques to improve performance of QUBO solvers
inferredcites →https://doi.org/10.1016/j.ejor.2017.08.025openalex-snapshot
Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems
inferredcites →https://doi.org/10.1016/j.ejor.2020.06.028openalex-snapshot
Large-scale influence maximization via maximal covering location
inferredcites →https://doi.org/10.1016/j.inffus.2024.102808openalex-snapshot
Quantum social network analysis: Methodology, implementation, challenges, and future directions
inferredcites →https://doi.org/10.1016/j.ins.2019.07.043openalex-snapshot
An efficient linear programming based method for the influence maximization problem in social networks
inferredcites →https://doi.org/10.1016/j.orl.2014.11.006openalex-snapshot
Optimization of stochastic virus detection in contact networks
inferredcites →https://doi.org/10.1016/j.sorms.2014.05.001openalex-snapshot
Monte Carlo sampling-based methods for stochastic optimization
inferredcites →https://doi.org/10.1023/a:1011122126881openalex-snapshot
Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth
inferredcites →https://doi.org/10.1038/s42005-023-01483-8openalex-snapshot
Identifying key players in complex networks via network entanglement
inferredcites →https://doi.org/10.1086/226707openalex-snapshot
Threshold Models of Collective Behavior
inferredcites →https://doi.org/10.1103/physreva.109.052441openalex-snapshot
Solving various NP-hard problems using exponentially fewer qubits on a quantum computer
inferredcites →https://doi.org/10.1103/physreva.65.012322openalex-snapshot
Robustness of adiabatic quantum computation
inferredcites →https://doi.org/10.1109/tkde.2016.2624734openalex-snapshot
Bring Order into the Samples: A Novel Scalable Method for Influence Maximization
inferredcites →https://doi.org/10.1109/tnet.2019.2898413openalex-snapshot
TipTop: (Almost) Exact Solutions for Influence Maximization in Billion-Scale Networks
inferredcites →https://doi.org/10.1109/tqe.2020.3031085openalex-snapshot
Solving the Max-Flow Problem on a Quantum Annealing Computer
inferredcites →https://doi.org/10.1145/1281192.1281239openalex-snapshot
Cost-effective outbreak detection in networks
inferredcites →https://doi.org/10.1145/2723372.2723734openalex-snapshot
Influence Maximization in Near-Linear Time
inferredcites →https://doi.org/10.1145/3648470openalex-snapshot
Social Network Analysis: A Survey on Process, Tools, and Application
inferredcites →https://doi.org/10.1145/3678184openalex-snapshot
Optimization Applications as Quantum Performance Benchmarks
inferredcites →https://doi.org/10.1145/956750.956769openalex-snapshot
Maximizing the spread of influence through a social network
inferredcites →https://doi.org/10.3389/fphy.2014.00005openalex-snapshot
Ising formulations of many NP problems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.