On the public citation graph
Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
0 signed · 51 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230060208openalex-snapshot
Maximum flow in probabilistic graphs‐the discrete case
inferredcites →https://doi.org/10.1002/net.3230070303openalex-snapshot
A statistical approach to the tsp
inferredcites →https://doi.org/10.1002/net.3230100203openalex-snapshot
A probabilistic model for the analysis of the routing process for circuits
inferredcites →https://doi.org/10.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1007/978-3-642-67091-6_15openalex-snapshot
The Complexity of Combinatorial Computations: An Introduction
inferredcites →https://doi.org/10.1007/bf01894879openalex-snapshot
On the existence of a factor of degree one of a connected random graph
inferredcites →https://doi.org/10.1007/bf02029168openalex-snapshot
On Hamilton-cycles of random graphs
inferredcites →https://doi.org/10.1016/0012-365x(76)90068-6openalex-snapshot
Hamiltonian circuits in random graphs
inferredcites →https://doi.org/10.1016/0012-365x(80)90172-7openalex-snapshot
Matchings in random regular bipartite digraphs
inferredcites →https://doi.org/10.1016/0020-0190(78)90007-8openalex-snapshot
On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs
inferredcites →https://doi.org/10.1016/0020-0190(78)90039-xopenalex-snapshot
A probabilistic minimum spanning tree algorithm
inferredcites →https://doi.org/10.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1017/s0305004100034095openalex-snapshot
The shortest path through many points
inferredcites →https://doi.org/10.1090/pspum/034/525336openalex-snapshot
Probabilistic analysis of a canonical numbering algorithm for graphs
inferredcites →https://doi.org/10.1090/s0002-9904-1969-12393-1openalex-snapshot
Asymptotics and random matrices with row-sum and column sum-restrictions
inferredcites →https://doi.org/10.1137/0207011openalex-snapshot
An Algorithm for Transitive Closure with Linear Expected Time
inferredcites →https://doi.org/10.1137/0208036openalex-snapshot
On the Expected Value of a Random Assignment Problem
inferredcites →https://doi.org/10.1137/0208045openalex-snapshot
A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
inferredcites →https://doi.org/10.1145/322077.322086openalex-snapshot
The Bottleneck Traveling Salesman Problem
inferredcites →https://doi.org/10.1145/356707.356711openalex-snapshot
A Survey of Analysis Techniques for Discrete Algorithms
inferredcites →https://doi.org/10.1145/800141.804687openalex-snapshot
A shortest-path algorithm with expected time O(n 2 log n log * n)
inferredcites →https://doi.org/10.1147/rd.134.0380openalex-snapshot
Algorithm and Average-value Bounds for Assignment Problems
inferredcites →https://doi.org/10.1287/moor.2.3.209openalex-snapshot
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
inferredcites →https://doi.org/10.1287/moor.3.2.89openalex-snapshot
An Asymptotic, Probabilistic Analysis of a Routing Problem
inferredcites →https://doi.org/10.1287/moor.5.1.1openalex-snapshot
Combinatorial Optimization: What is the State of the Art
inferredcites →https://doi.org/10.1287/moor.5.1.27openalex-snapshot
Probabilistic Analysis of the Planar k -Median Problem
inferredcites →https://doi.org/10.1287/opre.26.2.347openalex-snapshot
Technical Note—On the Expected Performance of Branch-and-Bound Algorithms
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-33394-2_3openalex-snapshot
On Given Diameter MST Problem on Random Input Data
inferred← citeshttps://doi.org/10.1007/bf01299451openalex-snapshot
On the expected optimal value of random assignment problems: Experimental results and open questions
inferred← citeshttps://doi.org/10.1007/bf01581700openalex-snapshot
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
inferred← citeshttps://doi.org/10.1007/bf01719448openalex-snapshot
Some recent results in the analysis of greedy algorithms for assignment problems
inferred← citeshttps://doi.org/10.1007/bf01916903openalex-snapshot
The asymptotic probabilistic behaviour of quadratic sum assignment problems
inferred← citeshttps://doi.org/10.1007/bf02186434openalex-snapshot
Chapter 2 parallel machines — Efficient algorithms, complexity results
inferred← citeshttps://doi.org/10.1007/bfb0008406openalex-snapshot
On finding sets of alternatives for the discrete multiobjective problems
inferred← citeshttps://doi.org/10.1016/0378-4754(93)90041-ropenalex-snapshot
Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms
inferred← citeshttps://doi.org/10.1016/j.endm.2006.08.042openalex-snapshot
Asymptotically optimal approach for solving some hard discrete optimization problems
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73231-6openalex-snapshot
Selected Topics in Scheduling Theory
inferred← citeshttps://doi.org/10.1080/02331938608843104openalex-snapshot
Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem
inferred← citeshttps://doi.org/10.1080/02331939108843732openalex-snapshot
Complexity of vector optimization problems on graphs
inferred← citeshttps://doi.org/10.1109/etfa.2001.997763openalex-snapshot
Multi-index assignment problem: an asymptotically optimal approach
inferred← citeshttps://doi.org/10.1134/s0005117919110092openalex-snapshot
A Hybrid Exact Algorithm for the Asymmetric Traveling Salesman Problem: Construction and a Statistical Study of Computational Efficiency
inferred← citeshttps://doi.org/10.1134/s1990478911020086openalex-snapshot
On the probabilistic analysis of an approximation algorithm for solving the p-median problem
inferred← citeshttps://doi.org/10.1515/dma.1994.4.2.89openalex-snapshot
Complexity of discrete multicriteria problems
inferred← citeshttps://doi.org/10.17323/1998-0663.2018.3.20.28openalex-snapshot
Эффективный по времени точный комбинированный алгоритм для асимметричной задачи коммивояжера
inferred← citeshttps://doi.org/10.5555/324493.324622openalex-snapshot
A least cost partition algorithm
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.