Search Results - "Randomised approximation algorithms"

Sequential Stub Matching for Asymptotically Uniform Generation of Directed Graphs with a Given Degree Sequence

Authors: Femke van Ieperen Ivan Kryven

Source: Ann Comb

Subject Terms: Randomised approximation algorithms, Original Paper, 05C80, 05C20, 0102 computer and information sciences, 68W20, 0101 mathematics, 01 natural sciences, 68W25, Directed graphs, Random graphs

Fast sequential algorithm for generating directed random graphs with a given degree sequence

Authors: Ieperen, Femke van Kryven, Ivan Mathematical Modeling et al.

Contributors: Ieperen, Femke van Kryven, Ivan Mathematical Modeling et al.

Subject Terms: math.PR, 05C80, 05C20, 68W20, 68W25, Random Graphs, Directed Graphs, Randomised Approximation Algorithms

File Description: application/pdf

Relation: https://dspace.library.uu.nl/handle/1874/415151

Availability: https://dspace.library.uu.nl/handle/1874/415151

Developing approximate algorithms for EPQ problem with process compressibility and random error in production/inspection.

Authors: Karimi-Nasab, M. Sabri-Laghaie, K.

Source: International Journal of Production Research; Apr2014, Vol. 52 Issue 8, p2388-2421, 34p, 1 Color Photograph, 1 Diagram, 6 Charts, 13 Graphs

Subject Terms: PRODUCTION management (Manufacturing), INDUSTRIAL management, PRODUCTION methods, PRODUCTION planning, PRODUCTION standards, ECONOMIC lot size, BACK orders, ALGORITHMS

Sequential Stub Matching for Asymptotically Uniform Generation of Directed Graphs with a Given Degree Sequence.

Authors: van Ieperen, Femke Kryven, Ivan

Source: Annals of Combinatorics; Jun2025, Vol. 29 Issue 2, p227-272, 46p

Subject Terms: RANDOM graphs, APPROXIMATION algorithms, ALGORITHMS, PROBABILITY theory

On the zeroes of hypergraph independence polynomials.

Authors: Galvin, David McKinley, Gwen Perkins, Will et al.

Source: Combinatorics, Probability & Computing; Jan2024, Vol. 33 Issue 1, p65-84, 20p

Subject Terms: POLYNOMIALS, STATISTICAL physics, COMBINATORICS, HYPERGRAPHS

Analysis of two production inventory systems with buffer, retrials and different production rates.

Authors: Jose, K. Nair, Salini

Source: Journal of Industrial Engineering International; Sep2017, Vol. 13 Issue 3, p369-380, 12p

Subject Terms: INVENTORIES, INDUSTRIAL engineering, INDUSTRIAL costs, COMPUTER integrated manufacturing systems, OPERATIONS research

Determining the Number of Solutions to Binary CSP Instances.

Authors: Angelsmark, Ola Jonsson, Peter Linusson, Svante et al.

Source: Principles & Practice of Constraint Programming - Cp 2002; 2006, p327-340, 14p

Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow: Extended abstract

Authors: Alistair Sinclair

Source: Lecture Notes in Computer Science ISBN: 9783540552840

Subject Terms: Deterministic network models in operations research, finite Markov chains, 0102 computer and information sciences, 0101 mathematics, 16. Peace & justice, 01 natural sciences, Markov chains (discrete-time Markov processes on discrete state spaces), multicommodity flow

File Description: application/xml

Access URL: https://dblp.uni-trier.de/db/conf/latin/latin92.html#Sinclair92
https://rd.springer.com/chapter/10.1007/BFb0023849
https://link.springer.com/chapter/10.1007/BFb0023849

Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow.

Authors: Sinclair, Alistair

Source: Combinatorics, Probability & Computing; Oct1992, Vol. 1 Issue 4, p351-370, 20p

Improved bounds for mixing rates of Markov chains and multicommodity flow

Authors: Alistair Sinclair The Pennsylvania State University CiteSeerX Archives

Contributors: Alistair Sinclair The Pennsylvania State University CiteSeerX Archives

Source: http://www.cs.berkeley.edu/~sinclair/flow.ps.

File Description: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.7952; http://www.cs.berkeley.edu/~sinclair/flow.ps

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.7952
http://www.cs.berkeley.edu/~sinclair/flow.ps

Computing The Volume Of Convex Bodies: A Case Where Randomness Provably Helps

Authors: Martin Dyer Alan Frieze The Pennsylvania State University CiteSeerX Archives

Contributors: Martin Dyer Alan Frieze The Pennsylvania State University CiteSeerX Archives

Source: http://www.math.cmu.edu/~af1p/volume.ps.gz.

File Description: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.2106; http://www.math.cmu.edu/~af1p/volume.ps.gz

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.2106
http://www.math.cmu.edu/~af1p/volume.ps.gz

Computing the volume of convex bodies : a case where randomness provably helps

Authors: Martin Dyer Frieze

Subject Terms: Other mathematical sciences not elsewhere classified, Convex bodies, Approximation theory, Mathematical Sciences not elsewhere classified

Relation: https://figshare.com/articles/journal_contribution/Computing_the_volume_of_convex_bodies_a_case_where_randomness_provably_helps/6477104

Availability: https://doi.org/10.1184/r1/6477104.v1
https://figshare.com/articles/journal_contribution/Computing_the_volume_of_convex_bodies_a_case_where_randomness_provably_helps/6477104

Complexity: Knots, Colourings and Countings

Authors: Dominic Welsh

A Deterministic Approximation Algorithm for the Densest k-Subgraph Problem

Authors: Billionnet, Alain Roupin, Frédéric Centre d'études et de recherche en informatique et communications (CEDRIC) et al.

Contributors: Billionnet, Alain Roupin, Frédéric Centre d'études et de recherche en informatique et communications (CEDRIC) et al.

Source: ISSN: 1745-7645.

Subject Terms: [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Availability: https://hal.science/hal-00596169
https://doi.org/10.1504/IJOR.2008.017534

Improved bounds for mixing rates of Markov chains and multicommodity flow

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: http://http.cs.berkeley.edu/~sinclair/flow.ps.

File Description: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.7540; http://http.cs.berkeley.edu/~sinclair/flow.ps

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.7540
http://http.cs.berkeley.edu/~sinclair/flow.ps

Computing the volume of convex bodies : a case where randomness provably helps

Authors: Dyer, Martin Frieze

Subject Terms: FOS: Mathematics, 19999 Mathematical Sciences not elsewhere classified

A deterministic approximation algorithm for the Densest k-Subgraph Problem

Authors: Frederic Roupin Alain Billionnet

Relation: http://www.inderscience.com/link.php?id=17534

Availability: http://www.inderscience.com/link.php?id=17534

Probabilistic Combinatorics and Its Applications

Authors: Béla Bollobás

Resource Type: eBook.

Subjects: Combinatorial probabilities, Random graphs

Categories: MATHEMATICS / Applied, MATHEMATICS / Probability & Statistics / General