Výsledky vyhľadávania - "Theory of computation → Linear programming"

Search-Space Reduction via Essential Vertices

Autori: Bumpus, Benjamin Merlin Jansen, Bart M. P. de Kroon, Jari J. H. a ďalší

Prispievatelia: Bumpus, Benjamin Merlin Jansen, Bart M. P. de Kroon, Jari J. H. a ďalší

Zdroj: SIAM Journal on Discrete Mathematics. 38:2392-2415

Predmety: FOS: Computer and information sciences, 0102 computer and information sciences, Computational Complexity (cs.CC), 15. Life on land, 01 natural sciences, 68W99, 7. Clean energy, Theory of computation → Packing and covering problems, Theory of computation → Fixed parameter tractability, essential vertices, Computer Science - Computational Complexity, Theory of computation → Graph algorithms analysis, fixed-parameter tractability, Computer Science - Data Structures and Algorithms, Theory of computation → Linear programming, Data Structures and Algorithms (cs.DS), ddc:004, covering versus packing, F.2.0

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2207.00386
https://research.tue.nl/en/publications/56170a91-b485-4bd7-8534-78fafe8b19a7
https://doi.org/10.1137/23M1589347
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.30