Results 21 to 30 of about 1,094,599 (317)
Approximation result toward nearest neighbor heuristic [PDF]
Yugoslav Journal of Operations Research, 2002 In this paper, we revisit the famous heuristic called nearest neighbor (N N) for the traveling salesman problem under maximization and minimization goal.
Monnot Jér"me
doaj +1 more source
On non-adaptive majority problems of large query size [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We are given $n$ balls and an unknown coloring of them with two colors. Our goal is to find a ball that belongs to the larger color class, or show that the color classes have the same size.
Dániel Gerbner, Máté Vizer
doaj +1 more source
Quicksort algorithm again revisited [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 We consider the standard Quicksort algorithm that sorts n distinct keys with all possible n! orderings of keys being equally likely. Equivalently, we analyze the total path length L(n) in a randomly built \emphbinary search tree.
Charles Knessl, Wojciech Szpankowski
doaj +1 more source
Evaluation of Spatial Clustering Algorithms for Analysis and Division of Hydrogen Ecosystems
, 2023 Geospatial data is of high relevance in modeling of hydrogen ecosystems, for instance to evaluate available areas, transport distances or existing infrastructure.
Weise, Friedrich
core +1 more source
How often should you clean your room? [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Analysis of ...
Kimball Martin, Krishnan Shankar
doaj +1 more source
Digital search trees with m trees: Level polynomials and insertion costs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Analysis of ...
Helmut Prodinger
doaj +1 more source
Mind the O˜: Asymptotically Better, but Still Impractical, Quantum Distributed Algorithms
, 2023 We present two algorithms in the quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability: one for producing an approximately optimal Steiner tree, and one for producing an exact directed minimum spanning tree, each of ...
David E. Bernal Neira +3 more
core +1 more source
A further analysis of Cuckoo Hashing with a Stash and Random Graphs of Excess r [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Analysis of ...
Reinhard Kutzelnigg
doaj +1 more source
On subtrees of the representation tree in rational base numeration systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Every rational number p/q defines a rational base numeration system in which every integer has a unique finite representation, up to leading zeroes. This work is a contribution to the study of the set of the representations of integers.
Shigeki Akiyama +2 more
doaj +1 more source
Arithmetics in β-numeration [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Analysis of ...
Julien Bernat
doaj +1 more source