On the public citation graph

Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions

0 signed · 111 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/rsa.1015openalex-snapshot
The ζ(2) limit in the random assignment problem
inferredcites →https://doi.org/10.1002/rsa.20057openalex-snapshot
Survey propagation: An algorithm for satisfiability
inferredcites →https://doi.org/10.1002/rsa.20072openalex-snapshot
Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
inferredcites →https://doi.org/10.1007/11830924_32openalex-snapshot
Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems
inferredcites →https://doi.org/10.1007/bf00247653openalex-snapshot
Auction algorithms for network flow problems: A tutorial introduction
inferredcites →https://doi.org/10.1007/bf02186476openalex-snapshot
The auction algorithm: A distributed relaxation method for the assignment problem
inferredcites →https://doi.org/10.1016/0012-365x(72)90006-4openalex-snapshot
Normal hypergraphs and the perfect graph conjecture
inferredcites →https://doi.org/10.1016/0095-8956(75)90041-6openalex-snapshot
On certain polytopes associated with graphs
inferredcites →https://doi.org/10.1016/b978-044488002-4/50004-xopenalex-snapshot
10.1016/b978-044488002-4/50004-x
inferredcites →https://doi.org/10.1016/s0304-0208(08)72920-7openalex-snapshot
Normal Hypergraphs and the Weak Perfect Graph Conjecture
inferredcites →https://doi.org/10.1017/cbo9780511804441openalex-snapshot
Convex Optimization
inferredcites →https://doi.org/10.1023/b:stco.0000021412.33763.d5openalex-snapshot
Tree consistency and bounds on the performance of the max-product algorithm and its generalizations
inferredcites →https://doi.org/10.1088/1742-5468/2004/06/p06007openalex-snapshot
Survey propagation as local equilibrium equations
inferredcites →https://doi.org/10.1088/1742-5468/2006/05/p05003openalex-snapshot
The number of matchings in random graphs
inferredcites →https://doi.org/10.1088/1742-5468/2008/06/l06001openalex-snapshot
On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs
inferredcites →https://doi.org/10.1103/physreve.68.036702openalex-snapshot
Polynomial iterative algorithms for coloring and analyzing random graphs
inferredcites →https://doi.org/10.1103/physreve.75.066708openalex-snapshot
Finding long cycles in graphs
inferredcites →https://doi.org/10.1103/physreve.76.031131openalex-snapshot
Phase transitions in the coloring of random graphs
inferredcites →https://doi.org/10.1109/18.904499openalex-snapshot
Efficient reconstruction of sequences
inferredcites →https://doi.org/10.1109/18.910577openalex-snapshot
The capacity of low-density parity-check codes under message-passing decoding
inferredcites →https://doi.org/10.1109/18.910585openalex-snapshot
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
inferredcites →https://doi.org/10.1109/18.910586openalex-snapshot
An analysis of belief propagation on the turbo decoding graph with Gaussian densities
inferredcites →https://doi.org/10.1109/isit.2005.1523648openalex-snapshot
Maximum weight matching via max-product belief propagation
inferredcites →https://doi.org/10.1109/isit.2006.261778openalex-snapshot
A Simpler Max-Product Maximum Weight Matching Algorithm and the Auction Algorithm
inferredcites →https://doi.org/10.1109/itw.2007.4313081openalex-snapshot
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
inferredcites →https://doi.org/10.1109/tit.1962.1057683openalex-snapshot
Low-density parity-check codes
inferredcites →https://doi.org/10.1109/tit.2004.842696openalex-snapshot
Using Linear Programming to Decode Binary Linear Codes
inferredcites →https://doi.org/10.1109/tit.2005.850091openalex-snapshot
A New Class of Upper Bounds on the Log Partition Function
inferredcites →https://doi.org/10.1109/tit.2005.856938openalex-snapshot
MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
inferredcites →https://doi.org/10.1109/tit.2006.883539openalex-snapshot
Consensus Propagation
inferredcites →https://doi.org/10.1109/tit.2007.915695openalex-snapshot
Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality
inferredcites →https://doi.org/10.1109/tit.2010.2040863openalex-snapshot
Convergence of Min-Sum Message-Passing for Convex Optimization
inferredcites →https://doi.org/10.1126/science.1094068openalex-snapshot
Inferring Cellular Networks Using Probabilistic Graphical Models
inferredcites →https://doi.org/10.1126/science.1136800openalex-snapshot
Clustering by Passing Messages Between Data Points
inferredcites →https://doi.org/10.1137/090753115openalex-snapshot
Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
inferredcites →https://doi.org/10.1137/1.9781611973068.22openalex-snapshot
Optimality of Belief Propagation for Random Assignment Problem
inferredcites →https://doi.org/10.1142/9789812796936_others05openalex-snapshot
Combinatorial Optimization
inferredcites →https://doi.org/10.1145/1132516.1132537openalex-snapshot
On the solution-space geometry of random constraint satisfaction problems
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1162/089976600300015880openalex-snapshot
Correctness of Local Probability Propagation in Graphical Models with Loops
inferredcites →https://doi.org/10.1162/089976601750541769openalex-snapshot
Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology
inferredcites →https://doi.org/10.1209/0295-5075/2/12/005openalex-snapshot
Mean-Field Equations for the Matching and the Travelling Salesman Problems
inferredcites →https://doi.org/10.1209/epl/i2006-10070-4openalex-snapshot
Sudden emergence of q -regular subgraphs in random graphs
inferredcites →https://doi.org/10.1887/0750303123/b365c84openalex-snapshot
Combinatorial optimization
inferredcites →https://doi.org/10.48550/arxiv.0705.4253openalex-snapshot
Convergence of the Min-Sum Algorithm for Convex Optimization
inferredcites →https://doi.org/10.48550/arxiv.1205.2639openalex-snapshot
MAP Estimation, Message Passing, and Perfect Graphs
inferredcites →https://doi.org/10.48550/arxiv.1206.5286openalex-snapshot
MAP Estimation, Linear Programming and Belief Propagation with Convex Free Energies
inferredcites →https://doi.org/10.48550/arxiv.cond-mat/0607290openalex-snapshot
A rigorous proof of the cavity method for counting matchings
inferredcites →https://doi.org/10.48550/arxiv.cs/0510044openalex-snapshot
Belief Propagation Based Multi--User Detection
inferredcites →https://doi.org/10.48550/arxiv.cs/0512078openalex-snapshot
Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes
inferredcites →https://doi.org/10.48550/arxiv.math/0010063openalex-snapshot
The zeta(2) limit in the random assignment problem
inferredcites →https://doi.org/10.5555/1070432.1070588openalex-snapshot
A new look at survey propagation and its generalizations
inferredcites →https://doi.org/10.5555/1077450.1077456openalex-snapshot
Survey propagation: An algorithm for satisfiability
inferredcites →https://doi.org/10.7551/mitpress/3349.003.0018openalex-snapshot
Correctness of Local Probability Propagation in Graphical Models with Loops
inferredcites →https://doi.org/10.7551/mitpress/4347.001.0001openalex-snapshot
Low-Density Parity-Check Codes

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-57173-3_1openalex-snapshot
Global Alignment of PPI Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-14974-5_23openalex-snapshot
Auction/Belief Propagation Algorithms for Constrained Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-17572-5_11openalex-snapshot
Local Dynamics in Bargaining Networks via Random-Turn Games
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_24openalex-snapshot
Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite
inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_18openalex-snapshot
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching
inferred← citeshttps://doi.org/10.1007/978-3-662-44917-2_35openalex-snapshot
Message Passing Algorithm for the Generalized Assignment Problem
inferred← citeshttps://doi.org/10.1007/s00224-019-09958-4openalex-snapshot
Optimizing Social Welfare for Network Bargaining Games in the Face of Instability, Greed and Idealism
inferred← citeshttps://doi.org/10.1007/s10479-014-1582-xopenalex-snapshot
Weighted matching as a generic pruning technique applied to optimization constraints
inferred← citeshttps://doi.org/10.1007/s10898-019-00749-2openalex-snapshot
Convergence and correctness of belief propagation for the Chinese postman problem
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2022.107755openalex-snapshot
A distributed message passing algorithm for the capacitated directed Chinese postman problem
inferred← citeshttps://doi.org/10.1016/j.dam.2021.12.025openalex-snapshot
Convergence and correctness of belief propagation for weighted min–max flow
inferred← citeshttps://doi.org/10.1016/j.jpdc.2023.04.007openalex-snapshot
A distributed message passing algorithm for computing perfect demand matching
inferred← citeshttps://doi.org/10.1016/j.patcog.2021.107957openalex-snapshot
PILS: Exploring high-order neighborhoods by pattern mining and injection
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.046openalex-snapshot
Belief propagation for the maximum-weight independent set and minimum spanning tree problems
inferred← citeshttps://doi.org/10.1063/1.2982805openalex-snapshot
A rigorous analysis of the cavity equations for the minimum spanning tree
inferred← citeshttps://doi.org/10.1088/0266-5611/32/7/075003openalex-snapshot
A hierarchical Bayesian-MAP approach to inverse problems in imaging
inferred← citeshttps://doi.org/10.1088/1742-5468/2008/06/l06001openalex-snapshot
On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs
inferred← citeshttps://doi.org/10.1088/1742-5468/2008/10/p10016openalex-snapshot
Exactness of belief propagation for some graphical models with loops
inferred← citeshttps://doi.org/10.1088/1742-5468/2016/11/113401openalex-snapshot
Typical performance of approximation algorithms for NP-hard problems
inferred← citeshttps://doi.org/10.1088/1742-5468/aad3f7openalex-snapshot
Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension
inferred← citeshttps://doi.org/10.1088/1751-8121/abee9dopenalex-snapshot
The planted k-factor problem
inferred← citeshttps://doi.org/10.1093/bioinformatics/btt235openalex-snapshot
CAMPways: constrained alignment framework for the comparative analysis of a pair of metabolic pathways
inferred← citeshttps://doi.org/10.1103/physreve.102.022304openalex-snapshot
Recovery thresholds in the sparse planted matching problem
inferred← citeshttps://doi.org/10.1103/physreve.106.054302openalex-snapshot
Planted matching problems on random hypergraphs
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797583openalex-snapshot
Networking sensors using belief propagation
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7363737openalex-snapshot
Practical message-passing framework for large-scale combinatorial optimization
inferred← citeshttps://doi.org/10.1109/icc.2019.8762006openalex-snapshot
Inference-Based Resource Allocation for Multi-Cell Backscatter Sensor Networks
inferred← citeshttps://doi.org/10.1109/icip.2014.7025267openalex-snapshot
A hierarchical Bayesian-map approach to computational imaging
inferred← citeshttps://doi.org/10.1109/lsp.2014.2337951openalex-snapshot
On the Convergence and Optimality of Reweighted Message Passing for Channel Assignment Problems
inferred← citeshttps://doi.org/10.1109/sahcnw.2009.5172929openalex-snapshot
Distributed Rate Allocation for Network-coded Systems
inferred← citeshttps://doi.org/10.1109/tit.2011.2110170openalex-snapshot
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
inferred← citeshttps://doi.org/10.1109/tit.2012.2227109openalex-snapshot
The Bethe Permanent of a Nonnegative Matrix
inferred← citeshttps://doi.org/10.1109/tit.2015.2466598openalex-snapshot
Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming
inferred← citeshttps://doi.org/10.1109/tit.2017.2788038openalex-snapshot
Maximum Weight Matching Using Odd-Sized Cycles: Max-Product Belief Propagation and Half-Integrality
inferred← citeshttps://doi.org/10.1109/tit.2022.3145232openalex-snapshot
Iterative Message Passing Algorithm for Vertex-Disjoint Shortest Paths
inferred← citeshttps://doi.org/10.1109/tvt.2016.2519921openalex-snapshot
Distributed Load Balancing via Message Passing for Heterogeneous Cellular Networks
inferred← citeshttps://doi.org/10.1137/15m1042565openalex-snapshot
Convergence and Correctness of Max-Product Belief Propagation for Linear Programming
inferred← citeshttps://doi.org/10.1142/s0217595922500373openalex-snapshot
Belief Propagation for Unbalanced Assignment Problem
inferred← citeshttps://doi.org/10.1145/2254756.2254764openalex-snapshot
Bipartite graph structures for efficient balancing of heterogeneous loads
inferred← citeshttps://doi.org/10.1145/2318857.2254764openalex-snapshot
Bipartite graph structures for efficient balancing of heterogeneous loads
inferred← citeshttps://doi.org/10.1145/2435209.2435212openalex-snapshot
Message-Passing Algorithms for Sparse Network Alignment
inferred← citeshttps://doi.org/10.1162/neco.2009.04-08-746openalex-snapshot
Quantifying Statistical Interdependence by Message Passing on Graphs—Part I: One-Dimensional Point Processes
inferred← citeshttps://doi.org/10.1287/opre.2019.1886openalex-snapshot
Hidden Hamiltonian Cycle Recovery via Linear Programming
inferred← citeshttps://doi.org/10.13130/malatesta-enrico-maria_phd2018-12-21openalex-snapshot
RANDOM COMBINATORIAL OPTIMIZATION PROBLEMS: MEAN FIELD AND FINITE-DIMENSIONAL RESULTS
inferred← citeshttps://doi.org/10.1561/9781601981851openalex-snapshot
Graphical Models, Exponential Families, and Variational Inference
inferred← citeshttps://doi.org/10.17771/pucrio.acad.61096openalex-snapshot
EXPLORING THE FRONTIER OF COMBINATORIAL OPTIMIZATION AND MACHINE LEARNING: APPLICATIONS TO VEHICLE ROUTING AND SUPPORT VECTOR MACHINES
inferred← citeshttps://doi.org/10.22028/d291-26583openalex-snapshot
Scalable optimization algorithms for recommender systems
inferred← citeshttps://doi.org/10.24963/ijcai.2020/475openalex-snapshot
Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising
inferred← citeshttps://doi.org/10.48550/arxiv.1211.3299openalex-snapshot
Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching
inferred← citeshttps://doi.org/10.48550/arxiv.1306.1167openalex-snapshot
A Graphical Transformation for Belief Propagation: Maximum Weight Matchings and Odd-Sized Cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1412.4972openalex-snapshot
Max-Product Belief Propagation for Linear Programming: Applications to Combinatorial Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1509.06849openalex-snapshot
Minimum Weight Perfect Matching via Blossom Belief Propagation
inferred← citeshttps://doi.org/10.5353/th_b5312337openalex-snapshot
Linear programming techniques for algorithms with applications in economics
inferred← citeshttps://doi.org/10.5555/1756006.1756040openalex-snapshot
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
inferred← citeshttps://doi.org/10.7916/d8xg9z41openalex-snapshot
Learning with Degree-Based Subgraph Estimation
showing the first 55 of 56 · page through all 56
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.