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

Fixed-Parameter Algorithms for Computing Bend-Restricted RAC Drawings of Graphs

Autoři: Cornelius Brand Robert Ganian Sebastian Röder a další

Zdroj: Journal of Graph Algorithms and Applications. 28:131-150

Témata: 0102 computer and information sciences, 01 natural sciences

Fixed-parameter algorithms for cardinality-constrained graph partitioning problems on sparse graphs

Autoři: Suguru Yamada Tesshu Hanaka

Zdroj: Lecture Notes in Computer Science ISBN: 9783031609237

Fixed-Parameter Algorithms for Unsplittable Flow Cover

Autoři: Andrés Cristi Mathieu Mari Andreas Wiese a další

Přispěvatelé: Andrés Cristi Mathieu Mari Andreas Wiese a další

Zdroj: Theory of Computing Systems. 67:89-124

Témata: Unsplittable Flow Cover, fixed parameter algorithms, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, ddc:004, [INFO] Computer Science [cs], approximation algorithms, 01 natural sciences, approximation al- gorithms

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2020/11903/pdf/LIPIcs-STACS-2020-42.pdf
https://hal.science/hal-03587595v1
https://doi.org/10.4230/lipics.stacs.2020.42
https://hal.science/hal-03587595v1/document
https://link.springer.com/article/10.1007/s00224-021-10048-7
https://www.narcis.nl/publication/RecordID/oai%3Aresearch.vu.nl%3Apublications%2F07d0abbe-3029-4af0-b7a5-5e4c427cbe08
https://research.vu.nl/en/publications/fixed-parameter-algorithms-for-unsplittable-flow-cover
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2020.42

Fixed-Parameter Algorithms for the Kneser and Schrijver Problems

Autoři: Ishay Haviv

Zdroj: SIAM Journal on Computing. 53:287-314

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, Combinatorics (math.CO), 0101 mathematics, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/abs/2204.09009

Improved kernelization and fixed-parameter algorithms for bicluster editing

Autoři: Manuel Lafond

Zdroj: Journal of Combinatorial Optimization. 47

Témata: graph algorithms, FOS: Computer and information sciences, kernelization, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), biclustering, Computer science, parameterized complexity

Popis souboru: application/xml

Přístupová URL adresa: http://arxiv.org/abs/2410.13123

Fixed-parameter algorithms for Fair Hitting Set problems

Autoři: Tanmay Inamdar Lawqueen Kanesh Madhumita Kundu a další

Přispěvatelé: Tanmay Inamdar Lawqueen Kanesh Madhumita Kundu a další

Zdroj: Information and Computation. 302:105261

Témata: FOS: Computer and information sciences, Fairness, Parameterized Algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Hitting Set

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2307.08854
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.55

Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs

Autoři: Guo, Mingyu Li, Jialiang Neumann, Aneta a další

Zdroj: Proceedings of the AAAI Conference on Artificial Intelligence. 36:9360-9367

Témata: FOS: Computer and information sciences, Artificial Intelligence (cs.AI), Computer Science - Computer Science and Game Theory, Computer Science - Artificial Intelligence, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences, Computer Science and Game Theory (cs.GT)

Přístupová URL adresa: http://arxiv.org/abs/2112.13175

Improved Kernelization and Fixed-parameter Algorithms for Bicluster Editing

Autoři: Lafond, Manuel

Témata: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2410.13123

Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs

Autoři: Christine Dahn Nils M. Kriege Petra Mutzel a další

Zdroj: Theoretical Computer Science. 852:172-184

Témata: FOS: Computer and information sciences, COMPLEXITY, Fixed-parameter tractable, MAXIMUM CUT, 101011 Graphentheorie, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 102031 Theoretische Informatik, Weighted maximum cut, 101011 Graph theory, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), OPTIMIZATION, 1-planar graphs, APPROXIMATION

Přístupová URL adresa: http://arxiv.org/pdf/1812.03074
http://arxiv.org/abs/1812.03074
https://ui.adsabs.harvard.edu/abs/2018arXiv181203074D/abstract
https://doi.org/10.1016/j.tcs.2020.11.030
https://www.sciencedirect.com/science/article/pii/S0304397520306721
https://dblp.uni-trier.de/db/journals/corr/corr1812.html#abs-1812-03074

Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs

Autoři: Cornelius Brand Robert Ganian Sebastian Röder a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783031492747

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS)

Přístupová URL adresa: http://arxiv.org/abs/2308.10600

Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem

Autoři: Guillaume Blin Alexandru Popa Mathieu Raffinot a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783031439797

Fixed Parameter Algorithms for Minor-Closed Graphs (of Locally Bounded Treewidth)

Autoři: Demaine, Erik D. Hajiaghayi, Mohammad Taghi

URL: https://hdl.handle.net/1721.1/149990
MIT-LCS-TR-904

Bounds and Fixed-Parameter Algorithms for Weighted Improper Coloring

Autoři: Tómas Ken Magnússon Bjorn Orri Saemundsson Bjarki Agust Gudmundsson

Zdroj: Electronic Notes in Theoretical Computer Science. 322:181-195

Témata: improper coloring, weighted improper coloring, fixed-parameter algorithms, coloring bounds, defective coloring, graph coloring, Theoretical Computer Science, Computer Science(all), 3. Good health

Fixed-parameter algorithms for scaffold filling

Autoři: Bulteau, Laurent Carrieri, Anna Paola DONDI, Riccardo

Zdroj: Lecture Notes in Computer Science ISBN: 9783319091730

Témata: Computational biology, Fixed-parameter algorithms, Genome comparison, Scaffold filling, 0206 medical engineering, Computer Science (all), Theoretical Computer Science, 0102 computer and information sciences, 02 engineering and technology, 16. Peace & justice, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://aisberg.unibg.it/bitstream/10446/35151/3/Dondi%20-%20Fixed%20parameter%20algorithms%20for%20scaffold%20filling.pdf
https://hal.archives-ouvertes.fr/hal-01260583/file/BCD-isco14.pdf
https://boa.unimib.it/handle/10281/61516
https://hal.archives-ouvertes.fr/hal-01260583
https://aisberg.unibg.it/handle/10446/31881
https://hal.archives-ouvertes.fr/hal-01260583/document
https://link.springer.com/chapter/10.1007/978-3-319-09174-7_12/fulltext.html
https://dblp.uni-trier.de/db/conf/iscopt/isco2014.html#BulteauCD14
https://aisberg.unibg.it/handle/10446/35151
https://rd.springer.com/chapter/10.1007%2F978-3-319-09174-7_12
https://www.sciencedirect.com/science/article/pii/S0304397514009827
https://dblp.uni-trier.de/db/journals/tcs/tcs568.html#BulteauCD15
https://hal.archives-ouvertes.fr/hal-01260577
https://boa.unimib.it/handle/10281/61526
http://springerlink.com/content/0302-9743/copyright/2005/
https://doi.org/10.1007/978-3-319-09174-7_12
https://hdl.handle.net/10281/61516
https://hdl.handle.net/10446/35151
https://doi.org/10.1016/j.tcs.2014.12.005

Optimal Correlated Equilibria in General-Sum Extensive-Form Games: Fixed-Parameter Algorithms, Hardness, and Two-Sided Column-Generation

Autoři: Brian Hu Zhang Gabriele Farina Andrea Celli a další

Zdroj: Mathematics of Operations Research.

Témata: FOS: Computer and information sciences, Computer Science - Machine Learning, Artificial Intelligence (cs.AI), Computer Science - Computer Science and Game Theory, Computer Science - Artificial Intelligence, 0502 economics and business, 05 social sciences, PUBLIC INFORMATION DECOMPOSITION, EXTENSIVE-FORM GAMES, CORRELATED EQUILIBRIUM, COLUMN GENERATION, Computer Science and Game Theory (cs.GT), Machine Learning (cs.LG)

Přístupová URL adresa: http://arxiv.org/abs/2203.07181

Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation

Autoři: Marx, Dániel Végh, László A. Fedor, V Fomin a další

Přispěvatelé: Marx, Dániel Végh, László A. Fedor, V Fomin a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783642392054
Lecture Notes in Computer Science
ACM Transactions on Algorithms
Automata, Languages, and Programming

Témata: FOS: Computer and information sciences, QA75 Electronic computers. Computer science / számítástechnika, QA Mathematics / matematika, connectivity augmentation, számítógéptudomány, fixed parameter algorithms, 0211 other engineering and technologies, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), QA74 Analysis / analízis

Popis souboru: text

Přístupová URL adresa: http://eprints.lse.ac.uk/69225/1/Vegh_Fixed_parameter.pdf
http://arxiv.org/abs/1304.6593
http://dblp.uni-trier.de/db/journals/talg/talg11.html#MarxV15
https://eprints.lse.ac.uk/69225/
https://rd.springer.com/chapter/10.1007/978-3-642-39206-1_61
https://core.ac.uk/display/42941008
https://dblp.uni-trier.de/db/journals/corr/corr1304.html#abs-1304-6593
https://arxiv.org/abs/1304.6593
https://dblp.uni-trier.de/db/conf/icalp/icalp2013-1.html#MarxV13
https://doi.org/10.1007/978-3-642-39206-1_61
https://link.springer.com/chapter/10.1007/978-3-642-39206-1_61
https://core.ac.uk/display/16379983
http://doi.org/10.1007/978-3-642-39206-1_61
https://eprints.sztaki.hu/9351/
http://eprints.lse.ac.uk/69225/

Fixed Parameter Algorithms and Hardness of Approximation Results for the Structural Target Controllability Problem

Autoři: Eugen Czeizler Alexandru Popa Victor Popescu

Zdroj: Scientific Annals of Computer Science, Vol XXXII, Iss 1, Pp 109-136 (2022)

Témata: Electronic computers. Computer science, QA75.5-76.95

Popis souboru: electronic resource

Relation: https://www.info.uaic.ro/en/sacs_articles/fixed-parameter-algorithms-and-hardness-of-approximation-results-for-the-structural-target-controllability-problem/; https://doaj.org/toc/1843-8121; https://doaj.org/toc/2248-2695

Přístupová URL adresa: https://doaj.org/article/149ffd6b6b6e405ab29dc31346220e1e

Fixed-Parameter Algorithms for Fair Hitting Set Problems

Autoři: Inamdar, Tanmay Kanesh, Lawqueen Kundu, Madhumita a další

Témata: Fairness, Parameterized Algorithms, Hitting Set, Data processing Computer science, InProceedings, publishedVersion

URL: https://drops.dagstuhl.de/opus/volltexte/2023/18589/

Exponential Speedup of Fixed Parameter Algorithms K_{3,3}-minor-free or K_5-minor-free Graphs

Autoři: Demaine, Erik D. Hajiaghayi, Mohammad Taghi Thilikos, Dimitrios M.

URL: https://hdl.handle.net/1721.1/149940
MIT-LCS-TR-838

Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs

Autoři: Brand, Cornelius Ganian, Robert Röder, Sebastian a další

Témata: Computer Science - Computational Geometry, Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2308.10600