Suchergebnisse - "linear-time algorithms"

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

Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint von Ene, Alina, Nguyen, Huy L

“… We consider fast algorithms for monotone submodular maximization subject to a matroid constraint …”
Volltext

Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness von Bianco, L., Błażewicz, J., Dell'Olmo, P., Drozdowski, M.

“… Linear time algorithms will be given for the case of two, three and four processors and the L max criterion …”
Volltext

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

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

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

Timed alignments with mixed moves von Rino, Neha, Chatain, Thomas

“… We study conformance checking for timed models, that is, process models that consider both the sequence of events that occur, as well as the timestamps at …”
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 new genomic evolutionary model for rearrangements, duplications, and losses that applies across eukaryotes and prokaryotes von Lin, Yu, Moret, Bernard M E

“… Genomic rearrangements have been studied since the beginnings of modern genetics and models for such rearrangements have been the subject of many papers over the last 10 years …”
Weitere Angaben

Restricted DCJ-indel model: sorting linear genomes with DCJ and indels von da Silva, Poly H, Machado, Raphael, Dantas, Simone, Braga, Marília DV

“… (inversions, fusions, fissions, translocations) to which genomes are subject, but allowing the existence of circular chromosomes at the intermediate steps …”
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 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

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

Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time von Hua, Kevin, Li, Daniel, Park, Jaewoo, Saranurak, Thatchaphol

“… Our work also removes a bottleneck to near-linear time algorithms for the vertex connectivity augmentation problem (Jordan '95 …”
Volltext

Algorithms for central-median paths with bounded length on trees von Becker, Ronald I., Lari, Isabella, Scozzari, Andrea

“… The location of path-shaped facilities on trees has been receiving a growing attention in the specialized literature in the recent years. Examples of such …”
Volltext

Approximation Algorithms for Size-Constrained Non-Monotone Submodular Maximization in Deterministic Linear Time von Chen, Yixin, Kuhnle, Alan

“… We present three deterministic, linear-time algorithms: a single-pass streaming algorithm with a ratio of \(23.313 + \epsilon …”
Volltext

Algorithms for path medi-centers of a tree von Averbakh, Igor, Berman, Oded

“… ). The case of linear combination of the two criteria and the case where one criterion is optimized subject to a restriction on the value of the other are considered and linear-time algorithms …”
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

New classes of efficiently solvable generalized Traveling Salesman Problems von Balas, E.

“… In one case, a positive integer k and an ordering (1,..., n) of the cities is given, and an optimal tour is sought subject to the condition that for any pair i, j ?(1,..., n), if j …”
Volltext