Kaiserslautern - Fachbereich Informatik
Refine
Year of publication
- 2010 (1) (remove)
Document Type
- Report (1) (remove)
Language
- English (1)
Has Fulltext
- yes (1)
Faculty / Organisational entity
In this article we present a method to generate random objects from a large variety of combinatorial classes according to a given distribution. Given a description of the combinatorial class and a set of sample data our method will provide an algorithm that generates objects of size n in worst-case runtime O(n^2) (O(n log(n)) can be achieved at the cost of a higher average-case runtime), with the generated objects following a distribution that closely matches the distribution of the sample data.