Výsledky vyhledávání - "Fixed-parameter tractable algorithm"
-
1
Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines
ISSN: 1094-6136, 1099-1425Vydáno: New York Springer US 01.04.2024Vydáno v Journal of scheduling (01.04.2024)“…Scheduling problems involving a set of dependent tasks with release dates and deadlines on a limited number of resources have been intensively studied…”
Získat plný text
Journal Article -
2
Electing a committee with dominance constraints
ISSN: 0254-5330, 1572-9338Vydáno: New York Springer US 01.11.2022Vydáno v Annals of operations research (01.11.2022)“…We consider the problem of electing a committee of k candidates, subject to constraints as to which committees are admissible for constitutional, conventional, or practical reasons…”
Získat plný text
Journal Article -
3
A fixed-parameter tractable approximation for capacitated k-supplier
ISSN: 0304-3975Vydáno: Elsevier B.V 04.01.2026Vydáno v Theoretical computer science (04.01.2026)“…•We study the uniform-capacitatedk-supplier problem with distinct facility and client sets.•The objective is to minimize the maximum distance between any…”
Získat plný text
Journal Article -
4
Efficient parsimony-based methods for phylogenetic network reconstruction
ISSN: 1367-4803, 1367-4811, 1460-2059, 1367-4811Vydáno: England Oxford University Press 15.01.2007Vydáno v Bioinformatics (15.01.2007)“…Motivation: Phylogenies—the evolutionary histories of groups of organisms—play a major role in representing relationships among biological entities. Although…”
Získat plný text
Journal Article -
5
Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond \(1/2\)-Approximation
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 23.04.2022Vydáno v arXiv.org (23.04.2022)“… The first is an offline fixed parameter tractable algorithm that guarantees a \(0.539\)-approximation for all non-negative submodular functions…”
Získat plný text
Paper -
6
Electing a committee with dominance constraints
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 16.05.2020Vydáno v arXiv.org (16.05.2020)“…We consider the problem of electing a committee of \(k\) candidates, subject to some constraints as to what this committee is supposed to look like…”
Získat plný text
Paper -
7
Parameterized Integer Quadratic Programming: Variables and Coefficients
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 10.04.2017Vydáno v arXiv.org (10.04.2017)“… We give a fixed parameter tractable algorithm for Integer Quadratic Programming parameterized by n…”
Získat plný text
Paper -
8
Approximation Algorithms for the Capacitated Domination Problem
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 11.05.2010Vydáno v arXiv.org (11.05.2010)“… demand of each vertex is satisfied subject to the capacity constraint of each vertex providing the service…”
Získat plný text
Paper