Suchergebnisse - "linear-time algorithm"

A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on a pedigree von Lai, En-Yu, Wang, Wei-Bung, Jiang, Tao, Wu, Kun-Pin

“… Background When studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal …”
Volltext

A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data von Szusz, Emily K., Willms, Allan R.

“… An algorithm that constructs a continuous piecewise linear representation, subject to a certain slope/segment length constraint, of a given set of data is described …”
Volltext

A Nearly-Linear Time Algorithm for Minimizing Risk of Conflict in Social Networks von Zhu, Liwang, Zhang, Zhongzhi

“… and other important phenomena over controversial social issues, which have been the subject of many recent works …”
Volltext

Advances in Discrete Applied Mathematics and Graph Theory

“… The present reprint contains twelve papers published in the Special Issue “Advances in Discrete Applied Mathematics and Graph Theory, 2021” of the MDPI …”
Volltext

Two algorithms for the Student-Project Allocation problem von Abraham, David J., Irving, Robert W., Manlove, David F.

“… We present two optimal linear-time algorithms for allocating students to projects, subject to the preference and capacity constraints …”
Volltext

A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint von Ene, Alina, Nguyen, Huy L

“… We consider the problem of maximizing a monotone submodular function subject to a knapsack constraint …”
Volltext

Finding paths in graphs avoiding forbidden transitions von Szeider, Stefan

“… T⊆ A . Our main result is that a dichotomy holds (subject to the assumption P≠NP). That is, for a considered class A , the problem is either (1) NP-complete, or (2 …”
Volltext

A linear time algorithm solving the legal firing sequence problem for a class of edge-weighted cactuses von Taoka, S., Watanabe, T.

“… The subject of the paper is the legal firing sequence problem of Petri nets (LFS): given a Petri net N, an initial marking M and a firing count vector X, find …”
Volltext

A linear time algorithm for minimum augmentation to 3-connect specified vertices of a graph von Mashima, T., Watanabe, T.

“… The subject of the paper is the 3-vertex-connectivity augmentation problem for a specified set of vertices (3VCA-SV …”
Volltext

Generalized Canonical Time Warping von Zhou, Feng, De la Torre, Fernando

“… Unlike exact DTW, which has quadratic complexity, we propose a linear time algorithm to minimize GCTW. (3 …”
Volltext

Local certification of graphs with bounded genus von Feuilloley, Laurent, Fraigniaud, Pierre, Montealegre, Pedro, Rapaport, Ivan, Rémila, Éric, Todinca, Ioan

“… ]. In particular, by using this compiler, every linear-time algorithm for deciding the membership to some fixed graph class can be translated into a dMAM(O(logn …”
Volltext

The generalized trust region subproblem: solution complexity and convex hull results von Wang, Alex L., Kılınç-Karzan, Fatma

“… A lifting of this problem recasts the GTRS as minimizing a linear objective subject to two nonconvex quadratic constraints …”
Volltext

An efficient algorithm for the limited-capacity many-to-many point matching in one dimension von Rajabi-Alni, Fatemeh, Minaei-Bidgoli, Behrouz, Bagheri, Alireza

“… > 0 denotes the capacity of p . In this paper, we present the first linear time algorithm for finding a minimum-cost one-dimensional LCMM (OLCMM …”
Volltext

Linear-Time Algorithms for Adaptive Submodular Maximization von Tang, Shaojie

“… We develop the first linear-time algorithm which achieves a \((1-1/e-\epsilon)\) approximation ratio …”
Volltext

Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan von Ji, Min, Cheng, T.C.E.

“… We consider a scheduling problem in which n jobs are to be processed on a single machine. The jobs are processed in batches and the processing time of each job …”
Volltext

Location-dependent generalization of road networks based on equivalent destinations von van Dijk, Thomas C., Haunert, Jan-Henrik, Oehrlein, Johannes

“… Suppose a user located at a certain vertex in a road network wants to plan a route using a wayfinding map. The user's exact destination may be irrelevant for …”
Volltext

A probabilistic interval-based event calculus for activity recognition von Artikis, Alexander, Makris, Evangelos, Paliouras, Georgios

“… We then propose a linear-time algorithm for computing all probabilistic temporal intervals of a given dataset …”
Volltext

Restricted power domination and zero forcing problems von Bozeman, Chassidy, Brimkov, Boris, Erickson, Craig, Ferrero, Daniela, Flagg, Mary, Hogben, Leslie

“… Power domination in graphs arises from the problem of monitoring an electric power system by placing as few measurement devices in the system as possible. A …”
Volltext

Algorithms for separable convex optimization with linear ascending constraints von Akhil, P T, Sundaresan, Rajesh

“… When the objective function is a so-called d - separable function, a simpler linear time algorithm solves the problem …”
Volltext

Target set selection with maximum activation time von Keiler, Lucas, Lima, Carlos V.G.C., Maia, Ana Karolinna, Sampaio, Rudini, Sau, Ignasi

“… A target set selection model is a graph G with a threshold function τ : V → N upper-bounded by the vertex degree. For a given model, a set S0 ⊆ V (G) is a …”
Volltext