scientific article; zbMATH DE number 3574966
From MaRDI portal
Publication:4144785
zbMath0368.68035MaRDI QIDQ4144785
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Randomized algorithms in combinatorial optimization: A survey ⋮ Worst-Case Analysis of Network Design Problem Heuristics ⋮ A-priori upper bounds for the set covering problem ⋮ On certain Hamiltonian inner triangulations ⋮ Secret sharing based on a hard-on-average problem ⋮ Coloring random graphs ⋮ Problems of discrete optimization: challenges and main approaches to solve them ⋮ Average polynomial time complexity of some NP-complete problems ⋮ Random decomposition of 0-1 linear integer programming problems and automatic choice of algorithms ⋮ Reduction techniques providing initial groupings for Euclidean traveling salesman patching algorithms ⋮ Optimal search algorithm for extrema of a discrete periodic bimodal function ⋮ A probabilistic analysis of the switching algorithm for the Euclidean TSP ⋮ Large deviations of the greedy independent set algorithm on sparse random graphs ⋮ Continuous approximation formulas for location problems ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics ⋮ Recent developments in information-based complexity ⋮ Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem ⋮ A data structure useful for finding Hamiltonian cycles ⋮ Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem ⋮ An appraisal of computational complexity for operations researchers ⋮ A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem ⋮ Expected parallel time and sequential space complexity of graph and digraph problems ⋮ Average case analysis of greedy algorithms for optimisation problems on set systems ⋮ The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs ⋮ Unnamed Item ⋮ Finding a large submatrix of a Gaussian random matrix ⋮ A generalization of maximal independent sets ⋮ Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint) ⋮ An Average Case NP-complete Graph Colouring Problem ⋮ A note on coloring sparse random graphs ⋮ Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs ⋮ Randomised algorithms ⋮ Searching for an optimal path in a tree with random costs ⋮ The largest tree in a random graph ⋮ How many random edges make a graph Hamiltonian? ⋮ A successful algorithm for the undirected Hamiltonian path problem ⋮ On the average-case complexity of parameterized clique ⋮ Convergence of optimal stochastic bin packing ⋮ The capacitated facility location problem with random input data ⋮ The Complexity of Public-Key Cryptography ⋮ Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning ⋮ Optimal low-degree hardness of maximum independent set ⋮ Average case optimality
