We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Background: Next-generation sequencing (NGS) offers a unique opportunity for high-throughput genomics and has potential to replace Sanger sequencing in many fields, including de-n...
Mattia C. F. Prosperi, Luciano Prosperi, Alessandr...
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
Felix Brandt, Markus Brill, Edith Hemaspaandra, La...
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Combinatorial auctions are difficult to analyze in part because of the vast number of potential strategies available to the bidders. Proxy bidding interfaces limit the users’ s...
Peter R. Wurman, Gangshu Cai, Jie Zhong, Ashish Su...