Výsledky vyhledávání - "fixed-parameter algorithms"

  • Zobrazuji výsledky 1 - 11 z 11
Upřesnit hledání
  1. 1

    Fixed-parameter algorithms for unsplittable flow cover Autor Cristi, Andrés, Mari, Mathieu, Wiese, Andreas

    ISSN: 1432-4350, 1433-0490
    Vydáno: Springer Verlag 01.03.2020
    Vydáno v 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…”
    Získat plný text
    Journal Article
  2. 2

    Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network Autor Shi, Feng, Li, Hangcheng, Rong, Guozhen, Zhang, Zhen, Wang, Jianxin

    ISSN: 1545-5963, 1557-9964, 1557-9964
    Vydáno: United States IEEE 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…”
    Získat plný text
    Journal Article
  3. 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 Autor Yu, Renjie, Oron, Daniel

    ISSN: 0377-2217
    Vydáno: Elsevier B.V 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…”
    Získat plný text
    Journal Article
  4. 4

    Computing maximum matchings in temporal graphs Autor Mertzios, George B., Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor, Zschoche, Philipp

    ISSN: 0022-0000, 1090-2724
    Vydáno: Elsevier Inc 01.11.2023
    “…Temporal graphs are graphs whose topology is subject to discrete changes over time…”
    Získat plný text
    Journal Article
  5. 5

    Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines Autor Hanen, Claire, Munier Kordon, Alix

    ISSN: 1094-6136, 1099-1425
    Vydáno: New York Springer US 01.04.2024
    Vydá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
  6. 6

    Computing Maximum Matchings in Temporal Graphs Autor Mertzios, George B, Molter, Hendrik, Niedermeier, Rolf, Zamaraev, Viktor, Zschoche, Philipp

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 29.09.2020
    Vydáno v arXiv.org (29.09.2020)
    “…Temporal graphs are graphs whose topology is subject to discrete changes over time…”
    Získat plný text
    Paper
  7. 7

    Exploiting Structure in CSP-related Problems Autor Färnqvist, Tommy

    ISBN: 9175197111, 9789175197111
    Vydáno: 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…”
    Získat plný text
    Dissertation
  8. 8

    Algorithmic interpretations of fractal dimension Autor Sidiropoulos, Anastasios, Sridhar, Vijay

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 27.03.2017
    Vydáno v arXiv.org (27.03.2017)
    “… These spaces are the subject of intensive study in various branches of mathematics, including geometry, topology, and measure theory…”
    Získat plný text
    Paper
  9. 9

    On the Parameterized Complexity of Eulerian Strong Component Arc Deletion Autor Blažej, Václav, Jana, Satyabrata, Ramanujan, M. S., Strulo, Peter

    ISSN: 0178-4617, 1432-0541
    Vydáno: New York Springer US 01.11.2025
    Vydáno v Algorithmica (01.11.2025)
    “… out (subject to the usual…”
    Získat plný text
    Journal Article
  10. 10

    AKURASI METODE KALIBRASI FIXED PARAMETER: STUDI PADA PERANGKAT UJIAN NASIONAL MATA PELAJARAN MATEMATIKA Autor Huriaty, Dina, Mardapi, Djemari

    ISSN: 2685-7111, 1410-4725, 2338-6061
    Vydáno: Universitas Negeri Yogyakarta 01.12.2014
    “…Penelitian ini bertujuan untuk (1) mengidentifikasi karakteristik butir-butir tes pada perangkat soal ujian nasional mata pelajaran Matematika tingkat SMP…”
    Získat plný text
    Journal Article
  11. 11

    Pattern Backtracking Algorithm for the Workflow Satisfiability Problem Autor Karapetyan, Daniel, Gagarin, Andrei, Gutin, Gregory

    ISSN: 2331-8422
    Vydáno: Ithaca Cornell University Library, arXiv.org 30.03.2015
    Vydáno v arXiv.org (30.03.2015)
    “…\). We propose a new fixed-parameter algorithm to solve the WSP with user-independent constraints…”
    Získat plný text
    Paper