Search Results - "Fixed-parameter algorithms"
-
1
Fixed-parameter algorithms for unsplittable flow cover
ISSN: 1432-4350, 1433-0490Published: Springer Verlag 01.03.2020Published in Theory of computing systems (01.03.2020)“… There is a polynomial time 4-approximation for the problem [Bar-Noy et al., STOC 2000] and also a QPTAS [Höhn et al., ICALP 2014]. In this paper we study fixed-parameter algorithms for the problem…”
Get full text
Journal Article -
2
Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network
ISSN: 1545-5963, 1557-9964, 1557-9964Published: United States IEEE 01.11.2022Published in IEEE/ACM transactions on computational biology and bioinformatics (01.11.2022)“…Phylogenetic trees are unable to represent the evolutionary process for a collection of species if reticulation events happened, and a generalized model named…”
Get full text
Journal Article -
3
Single-machine scheduling with fixed energy recharging times to minimize the number of late jobs and the number of just-in-time jobs: A parameterized complexity analysis
ISSN: 0377-2217Published: Elsevier B.V 01.07.2025Published in European journal of operational research (01.07.2025)“… This study aims to analyze the parameterized tractability of the two problems and develop fixed-parameter algorithms with respect to three natural parameters…”
Get full text
Journal Article -
4
Computing maximum matchings in temporal graphs
ISSN: 0022-0000, 1090-2724Published: Elsevier Inc 01.11.2023Published in Journal of computer and system sciences (01.11.2023)“…Temporal graphs are graphs whose topology is subject to discrete changes over time…”
Get full text
Journal Article -
5
Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines
ISSN: 1094-6136, 1099-1425Published: New York Springer US 01.04.2024Published in 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…”
Get full text
Journal Article -
6
Computing Maximum Matchings in Temporal Graphs
ISSN: 2331-8422Published: Ithaca Cornell University Library, arXiv.org 29.09.2020Published in arXiv.org (29.09.2020)“…Temporal graphs are graphs whose topology is subject to discrete changes over time…”
Get full text
Paper -
7
Exploiting Structure in CSP-related Problems
ISBN: 9175197111, 9789175197111Published: 2013“…, subject to these constraints. The first main part of the thesis is concerned with studying restrictions on the structure induced by the constraints on the variables…”
Get full text
Dissertation -
8
Algorithmic interpretations of fractal dimension
ISSN: 2331-8422Published: Ithaca Cornell University Library, arXiv.org 27.03.2017Published in arXiv.org (27.03.2017)“… These spaces are the subject of intensive study in various branches of mathematics, including geometry, topology, and measure theory…”
Get full text
Paper -
9
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
ISSN: 0178-4617, 1432-0541Published: New York Springer US 01.11.2025Published in Algorithmica (01.11.2025)“… out (subject to the usual…”
Get full text
Journal Article -
10
AKURASI METODE KALIBRASI FIXED PARAMETER: STUDI PADA PERANGKAT UJIAN NASIONAL MATA PELAJARAN MATEMATIKA
ISSN: 2685-7111, 1410-4725, 2338-6061Published: Universitas Negeri Yogyakarta 01.12.2014Published in Jurnal Penelitian dan Evaluasi Pendidikan (01.12.2014)“…Penelitian ini bertujuan untuk (1) mengidentifikasi karakteristik butir-butir tes pada perangkat soal ujian nasional mata pelajaran Matematika tingkat SMP…”
Get full text
Journal Article -
11
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem
ISSN: 2331-8422Published: Ithaca Cornell University Library, arXiv.org 30.03.2015Published in arXiv.org (30.03.2015)“…\). We propose a new fixed-parameter algorithm to solve the WSP with user-independent constraints…”
Get full text
Paper

