Suchergebnisse - optimal output-sensitive algorithm

Optimal, output-sensitive algorithms for constructing planar hulls in parallel von Gupta, Neelima, Sen, Sandeep

“… In this paper we focus on the problem of designing very fast parallel algorithms for the planar convex hull problem that achieve the optimal O( nlog H …”
Volltext

Output-Sensitive Construction of Reeb Graphs von Doraiswamy, H., Natarajan, V.

“… This paper describes a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds or non-manifolds in any dimension …”
Volltext

On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm von Bhattacharya, Binay K, Sen, Sandeep

“… In this paper we present a truly practical and provably optimalO(nlogh) time output-sensitive algorithm for the planar convex hull problem …”
Volltext

Simple and optimal output-sensitive construction of contour trees using monotone paths von Chiang, Yi-Jen, Lenz, Tobias, Lu, Xiang, Rote, Günter

“… The algorithm is simple, achieves the optimal output-sensitive bound in running time, and works in any dimension …”
Volltext

Fast stabbing of boxes in high dimensions von Nielsen, Frank

“… ( S) points in output-sensitive time O(dn log c( S)) and linear space. Let c ∗( S) and b ∗( S) be, respectively, the minimum number of points required to stab S and the …”
Volltext

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques von Dalirrooyfard, Mina, Mathialagan, Surya, Williams, Virginia Vassilevska, Xu, Yinzhan

“… Previously, the only known conditionally optimal output-sensitive algorithms were for the case of \(3\)-cliques by Bj\"{o}rklund, Pagh, Vassilevska W …”
Volltext

Planar lower envelope of monotone polygonal chains von Lu, Daniel L.

“… This can be applied to output-sensitive construction of lower envelopes for n arbitrary line segments in optimal O(nlog⁡k …”
Volltext

Instance-Optimal Geometric Algorithms von Afshani, P., Barbay, J., Chan, T.M.

“… We prove the existence of an algorithm A for computing 2-d or 3-dconvex hulls that is optimal for every point set in the following sense …”
Volltext

Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima von Gupta, Neelima, Sen, Sandeep

“… In this paper we focus on the problem of designing very fast parallel algorithms for the convex hull and the vector maxima problems in three dimensions that are output-size sensitive …”
Volltext

Reactive Synthesis: Towards Output-Sensitive Algorithms

Volltext

Longest increasing subsequences in windows based on canonical antichain partition von Chen, Erdong, Yang, Linji, Yuan, Hao

“… a canonical antichain partition in windows, we present an optimal output-sensitive algorithm to solve this problem in O ( output …”
Volltext

Short-Term Scheduling of Expected Output-Sensitive Cascaded Hydro Systems Considering the Provision of Reserve Services von Zhong, Ruhong, Cheng, Chuntian, Liao, Shengli, Zhao, Zhipeng

“… The multi-step progressive optimality algorithm (MSPOA) is used for the STHS problem. An iterative approximation method is proposed to determine the forebay level and output under the condition of the sensitive …”
Volltext

The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive von Manoussakis, George

“… So far it was unknown whether it was output sensitive or not. In this paper we partially answer this question by proving that the Bron-Kerbosch Algorithm with vertex ordering, first introduced and studied by Eppstein, L …”
Volltext

A framework for recursive algorithms in low-energy broadcast networks von Lewis, Timothy B., Stout, Quentin F.

“… As a simple example, we provide a quick-sort algorithm which is optimal for both time …”
Volltext

On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms von Conte, Alessio, Tomita, Etsuji

“… •We prove cliques and bk are output-sensitive if the largest clique has size O(log⁡n), and show this is true in real graphs …”
Volltext

An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints von Kurita, Kazuhiro, Wasa, Kunihiro

“… However, k-best enumeration tends to be intractable since, in many cases, finding one optimum solution is NP-hard …”
Volltext

An Instance-optimal Algorithm for Bichromatic Rectangular Visibility von Cardinal, Jean, Dallant, Justin, Iacono, John

“… Afshani, Barbay and Chan (2017) introduced the notion of instance-optimal algorithm in the order-oblivious setting …”
Volltext

Complexity of the multiobjective minimum weight minimum stretch spanner problem von Bökler, Fritz, Jasper, Henning

“… In this paper, we take an in-depth look at the complexity of a hitherto unexplored multiobjective minimum weight minimum stretch spanner problem; or in short …”
Volltext

Constant amortized time enumeration of Eulerian trails von Kurita, Kazuhiro, Wasa, Kunihiro

“… •This paper shows optimal algorithms for Eulerian trails which run in constant time per solution on average …”
Volltext

Longest increasing subsequences in sliding windows von Albert, Michael H, Golynski, Alexander, Hamel, Angèle M, López-Ortiz, Alejandro, Rao, S.Srinivasa, Safari, Mohammad Ali

“… This data structure substantially improves over the naı̈ve generalization of the longest increasing subsequence algorithm and in fact produces an output-sensitive …”
Volltext