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

  1. 1

    Fixed-parameter algorithms for graph constraint logic Autor Hatanaka, Tatsuhiko, Hommelsheim, Felix, Ito, Takehiro, Kobayashi, Yusuke, Mühlenthaler, Moritz, Suzuki, Akira

    ISSN: 0304-3975
    Vydáno: Elsevier B.V 30.05.2023
    Vydáno v Theoretical computer science (30.05.2023)
    “…Non-deterministic constraint logic (NCL) is a simple model of computation based on orientations of a constraint graph with edge weights and vertex demands. NCL…”
    Získat plný text
    Journal Article
  2. 2

    Fixed-Parameter Algorithms for Maximum Agreement Forests Autor Whidden, Chris, Beiko, Robert G., Zeh, Norbert

    ISSN: 0097-5397, 1095-7111
    Vydáno: Philadelphia Society for Industrial and Applied Mathematics 01.01.2013
    Vydáno v SIAM journal on computing (01.01.2013)
    “…We present new and improved fixed-parameter algorithms for computing maximum agreement forests of pairs of rooted binary phylogenetic trees…”
    Získat plný text
    Journal Article
  3. 3

    Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane Autor Cambazard, Hadrien, Catusse, Nicolas

    ISSN: 0377-2217, 1872-6860
    Vydáno: Elsevier B.V 16.10.2018
    “…•A fixed-parameter algorithm for the rectilinear travelling salesman problem.•A fixed-parameter algorithm for the rectilinear Steiner tree problem…”
    Získat plný text
    Journal Article
  4. 4

    Fixed-parameter algorithms for Fair Hitting Set problems Autor Inamdar, Tanmay, Kanesh, Lawqueen, Kundu, Madhumita, Purohit, Nidhi, Saurabh, Saket

    ISSN: 0890-5401
    Vydáno: Elsevier Inc 01.01.2025
    Vydáno v Information and computation (01.01.2025)
    “…Selection of a group of representatives satisfying certain fairness constraints, is a commonly occurring scenario. Motivated by this, we initiate a systematic…”
    Získat plný text
    Journal Article
  5. 5

    Fixed-Parameter Algorithms for Unsplittable Flow Cover Autor Cristi, Andrés, Mari, Mathieu, Wiese, Andreas

    ISSN: 1432-4350, 1433-0490
    Vydáno: New York Springer US 01.02.2023
    Vydáno v Theory of computing systems (01.02.2023)
    “… . There is a polynomial time 4-approximation for the problem (Bar-Noy et al. STOC 2001 ) and also a QPTAS (Höhn et al. ICALP 2018 ). In this paper we study fixed-parameter algorithms for the problem…”
    Získat plný text
    Journal Article
  6. 6

    Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs Autor Giannopoulou, Archontia C., Mertzios, George B., Niedermeier, Rolf

    ISSN: 0304-3975, 1879-2294
    Vydáno: Elsevier B.V 15.08.2017
    Vydáno v Theoretical computer science (15.08.2017)
    “…We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time…”
    Získat plný text
    Journal Article
  7. 7

    Fixed-parameter algorithms for scaffold filling Autor Bulteau, Laurent, Carrieri, Anna Paola, Dondi, Riccardo

    ISSN: 0304-3975, 1879-2294
    Vydáno: Elsevier B.V 01.02.2015
    Vydáno v Theoretical computer science (01.02.2015)
    “…The new sequencing technologies, called next-generation sequencing, provide a huge amount of data that can be used to reconstruct genomes. However, the methods…”
    Získat plný text
    Journal Article
  8. 8

    Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs Autor Yamada, Suguru, Hanaka, Tesshu

    ISSN: 0166-218X
    Vydáno: Elsevier B.V 15.10.2025
    Vydáno v Discrete Applied Mathematics (15.10.2025)
    “…For an undirected and edge-weighted graph G=(V,E) and a vertex subset S⊆V, we define a function φG(S)≔(1−α)⋅w(S)+α⋅w(S,V∖S), where α∈[0,1] is a real number,…”
    Získat plný text
    Journal Article
  9. 9

    Improved kernelization and fixed-parameter algorithms for bicluster editing Autor Lafond, Manuel

    ISSN: 1382-6905, 1573-2886
    Vydáno: New York Springer US 01.07.2024
    Vydáno v Journal of combinatorial optimization (01.07.2024)
    “…Given a bipartite graph G , the Bicluster Editing problem asks for the minimum number of edges to insert or delete in G so that every connected component is a…”
    Získat plný text
    Journal Article
  10. 10

    Fixed-parameter algorithms for vertex cover P3 Autor Chang, Maw-Shang, Chen, Li-Hsuan, Hung, Ling-Ju, Rossmanith, Peter, Su, Ping-Chen

    ISSN: 1572-5286, 1873-636X
    Vydáno: Elsevier B.V 01.02.2016
    Vydáno v Discrete optimization (01.02.2016)
    “… set of size at most k in the input graph. In this paper, we give two fixed parameter algorithms to solve the k-Vertex CoverP3 problem…”
    Získat plný text
    Journal Article
  11. 11

    Fixed-parameter algorithms for Kemeny rankings Autor Betzler, Nadja, Fellows, Michael R., Guo, Jiong, Niedermeier, Rolf, Rosamond, Frances A.

    ISSN: 0304-3975, 1879-2294
    Vydáno: Elsevier B.V 28.10.2009
    Vydáno v Theoretical computer science (28.10.2009)
    “…The computation of Kemeny rankings is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of…”
    Získat plný text
    Journal Article
  12. 12

    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
  13. 13
  14. 14

    Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs Autor Brand, Cornelius, Ganian, Robert, Röder, Sebastian, Schager, Florian

    ISSN: 1526-1719, 1526-1719
    Vydáno: 06.11.2024
    “…In a right-angle crossing (RAC) drawing of a graph, each edge is represented as a polyline and edge crossings must occur at an angle of exactly $90^\circ$,…”
    Získat plný text
    Journal Article
  15. 15

    Fixed-parameter algorithms for DAG Partitioning Autor van Bevern, René, Bredereck, Robert, Chopin, Morgan, Hartung, Sepp, Hüffner, Falk, Nichterlein, André, Suchý, Ondřej

    ISSN: 0166-218X, 1872-6771
    Vydáno: Amsterdam Elsevier B.V 31.03.2017
    Vydáno v Discrete Applied Mathematics (31.03.2017)
    “…Finding the origin of short phrases propagating through the web has been formalized by Leskovec et al. (2009) as DAG Partitioning: given an arc-weighted…”
    Získat plný text
    Journal Article
  16. 16

    Fixed-Parameter Algorithms for Cluster Vertex Deletion Autor Hüffner, Falk, Komusiewicz, Christian, Moser, Hannes, Niedermeier, Rolf

    ISSN: 1432-4350, 1433-0490
    Vydáno: New York Springer-Verlag 01.07.2010
    Vydáno v Theory of computing systems (01.07.2010)
    “… The parameter is the number of vertex deletions. We present efficient fixed-parameter algorithms for CVD applying the fairly new iterative compression technique…”
    Získat plný text
    Journal Article
  17. 17

    Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization Autor Guo, Jiong, Gramm, Jens, Hüffner, Falk, Niedermeier, Rolf, Wernicke, Sebastian

    ISSN: 0022-0000, 1090-2724
    Vydáno: Elsevier Inc 01.12.2006
    “… We extend this to an algorithm enumerating all solutions in O ( d k ⋅ m ) time for a (larger) constant d. As a further result, we present a fixed-parameter algorithm with runtime O…”
    Získat plný text
    Journal Article
  18. 18

    Randomized Fixed-Parameter Algorithms for the Closest String Problem Autor Chen, Zhi-Zhong, Ma, Bin, Wang, Lusheng

    ISSN: 0178-4617, 1432-0541
    Vydáno: New York Springer US 01.01.2016
    Vydáno v Algorithmica (01.01.2016)
    “… s i . The problem is NP-hard and has been extensively studied in the context of approximation algorithms and fixed-parameter algorithms…”
    Získat plný text
    Journal Article
  19. 19

    Fixed-parameter algorithms for the cocoloring problem Autor Campos, Victor, Klein, Sulamita, Sampaio, Rudini, Silva, Ana

    ISSN: 0166-218X, 1872-6771
    Vydáno: Elsevier B.V 20.04.2014
    Vydáno v Discrete Applied Mathematics (20.04.2014)
    “…A (k,ℓ)-cocoloring of a graph G is a partition of the vertex set of G into at most k independent sets and at most ℓ cliques. It is known that determining the…”
    Získat plný text
    Journal Article
  20. 20

    Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem Autor Czeizler, Eugen, Popa, Alexandru, Popescu, Victor

    ISSN: 1843-8121, 2248-2695
    Vydáno: 22.06.2022
    Vydáno v Scientific annals of computer science (22.06.2022)
    “…Recent research has revealed new and unexpected applications of network control science within biomedicine, pharmacology, and medical therapeutics. These new…”
    Získat plný text
    Journal Article