Search Results - analysis of algorithms and problems complexity

Mandatory Critical Points of 2D Uncertain Scalar Fields by Günther, David, Salmon, Joseph, Tierny, Julien

“… The characterization is based on the analysis of the support of the probability density functions (PDF) of the input data. Given two scalar fields representing reliable estimations…”
Get full text

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions by Larsson, Thomas, Källberg, Linus

“…In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension…”
Get full text

Energy-aware lot sizing problem: Complexity analysis and exact algorithms by Rapine, Christophe, Goisque, Guillaume, Akbalik, Ayse

“…The single-item lot sizing problem under a periodic energy limitation is considered in this paper…”
Get full text

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams by Bennett, H., Papadopoulou, E., Yap, C.

“… We describe a subdivision algorithm for computing a clustered ε‐isotopic approximation of the minimization diagram of X…”
Get full text

Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems by Bergou, El Houcine, Diouane, Youssef, Kungurtsev, Vyacheslav

“…The Levenberg–Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems…”
Get full text

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis by LaRusic, John, Punnen, Abraham P.

“… Various lower bound algorithms are proposed and the relative strengths of each of these bounds are examined using theoretical and experimental analysis. A polynomial time ⌈n/2…”
Get full text

New Bounds on the Size of Optimal Meshes by Sheehy, Donald R.

“…The theory of optimal size meshes gives a method for analyzing the output size (number of simplices) of a Delaunay refinement mesh in terms of the integral of…”
Get full text

NP-hardness of deciding convexity of quartic polynomials and related problems by Ahmadi, Amir Ali, Olshevsky, Alex, Parrilo, Pablo A., Tsitsiklis, John N.

“…) is globally convex. This solves a problem that has been open since 1992 when N. Z. Shor asked for the complexity of deciding convexity for quartic polynomials…”
Get full text

Description and Solution of an Unreported Intrinsic Bias in Photon Mapping Density Estimation with Constant Kernel by García, R., Ureña, C., Sbert, M.

“…This paper presents an analysis of the irradiance estimator often used in photon mapping algorithms and concludes that the classical approach with a constant kernel overestimates the correct value…”
Get full text

Biased initialization in random walk algorithms for k -SAT: a generalization of Schöning's method by Ghosh, Subhas Kumar, Vittamsetti, Vijay Monic

Get full text

Improved grid map layout by point set matching by Eppstein, David, van Kreveld, Marc, Speckmann, Bettina, Staals, Frank

“…Associating the regions of a geographic subdivision with the cells of a grid is a basic operation that is used in various types of maps, like spatially ordered…”
Get full text

Cut Query Algorithms with Star Contraction by Apers, Simon, Efron, Yuval, Gawrychowski, Pawel, Lee, Troy, Mukhopadhyay, Sagnik, Nanongkai, Danupon

“…We study the complexity of determining the edge connectivity of a simple graph with cut queries. We show…”
Get full text

Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs by Yeh, Hao-Ping, Lu, Wei, Chen, Li-Hsuan, Hung, Ling-Ju, Klasing, Ralf, Hsieh, Sun-Yuan

“… minimized. In this paper, we prove that the Starp-Hub Routing Cost Problem is NP-hard. A 3-approximation algorithm running in time O(n2…”
Get full text

Nearly Optimal Communication and Query Complexity of Bipartite Matching by Blikstad, Joakim, Van Den Brand, Jan, Efron, Yuval, Mukhopadhyay, Sagnik, Nanongkai, Danupon

“…We settle the complexities of the maximum-cardinality bipartite matching problem (BMM…”
Get full text

(Re)packing Equal Disks into Rectangle by Fomin, Fedor V., Golovach, Petr A., Inamdar, Tanmay, Saurabh, Saket, Zehavi, Meirav

“…The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem…”
Get full text

Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG by Caceres, Manuel, Mumey, Brendan, Husic, Edin, Rizzi, Romeo, Cairo, Massimo, Sahlin, Kristoffer, Tomescu, Alexandru I.

“…A multi-assembly problem asks to reconstruct multiple genomic sequences from mixed reads sequenced from all of…”
Get full text

Efficient assembly consensus algorithms for divergent contig sets by Chateau, Annie, Davot, Tom, Lafond, Manuel

“… This amounts to orienting and ordering sets of contigs, which can be viewed as an optimization problem where the aim is to find an alignment of two fragmented strings that maximizes an arbitrary…”
Get full text

Computational Complexity Analysis of Ant Colony Clustering Algorithms: Application to Student's Grouping Problem by Chniter, Malak, Abid, Abir, Kallel, Ilhem, Kanoun, Slim

“…The task of assessing, grouping and arranging data into meaningful groups or clusters based on their similarities/dissimilarities measures known as cluster analysis…”
Get full text

Algorithms and Complexity on Indexing Founder Graphs by Equi, Massimo, Norri, Tuukka, Alanko, Jarno, Cazaux, Bastien, Tomescu, Alexandru I., Mäkinen, Veli

“…We study the problem of matching a string in a labeled graph. Previous research has shown that unless the Orthogonal Vectors Hypothesis (OVH…”
Get full text

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems by Le Gall, François, Seddighin, Saeed

“…) are three fundamental string problems that can be classically solved in near linear time. In this work, we present sublinear time quantum algorithms for these problems along with quantum lower bounds…”
Get full text