On some probability inequalities for some discrete optimization problems
From MaRDI portal
Publication:3416558
Recommendations
Cited in
(8)- Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
- scientific article; zbMATH DE number 1985665 (Why is no real title available?)
- Probabilistic analysis of an approximation algorithm for the m-peripatetic salesman problem on random instances unbounded from above
- Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph
- scientific article; zbMATH DE number 7059571 (Why is no real title available?)
- Martingale Inequalities and NP-Complete Problems
- Edge-disjoint spanning trees of arbitrary bounded diameter on random inputs
This page was built for publication: On some probability inequalities for some discrete optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416558)
