Výsledky vyhľadávania - "exponential algorithm"

Many-visits TSP revisited

Autori: Kowalik, Łukasz Li, Shaohua Nadara, Wojciech a ďalší

Prispievatelia: Kowalik, Łukasz Li, Shaohua Nadara, Wojciech a ďalší

Zdroj: 28th Annual European Symposium on Algorithms (ESA 2020)
J. Comput. Syst. Sci.

Predmety: Theory of computation → Graph algorithms analysis, exponential algorithm, many visits traveling salesman problem, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Theory of computation → Parameterized complexity and exact algorithms, 0102 computer and information sciences, 02 engineering and technology, ddc:004, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2005.02329
https://www.sciencedirect.com/science/article/pii/S0022000021000908
https://arxiv.org/abs/2005.02329
https://dblp.uni-trier.de/db/journals/corr/corr2005.html#abs-2005-02329
https://drops.dagstuhl.de/opus/volltexte/2020/12932/
https://drops.dagstuhl.de/opus/volltexte/2020/12932/pdf/LIPIcs-ESA-2020-66.pdf/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.66

Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification

Autori: Galby, Esther Kisfaludi-Bak, Sándor Marx, Dániel a ďalší

Prispievatelia: Galby, Esther Kisfaludi-Bak, Sándor Marx, Dániel a ďalší

Predmety: Directed Steiner Network, Sub-exponential algorithm

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.67

Dostupnosť: https://doi.org/10.4230/LIPIcs.ICALP.2024.67
https://nbn-resolving.org/urn:nbn:de:0030-drops-202104
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.67

On the Complexity of Finding Large Odd Induced Subgraphs and Odd Colorings

Autori: Belmonte, Rémy Sau, Ignasi Gouat, Isabelle

Prispievatelia: Belmonte, Rémy Sau, Ignasi Gouat, Isabelle

Zdroj: Lecture Notes in Computer Science ISBN: 9783030604394

Predmety: odd subgraph, single-exponential algorithm, 0211 other engineering and technologies, [MATH] Mathematics [math], G.2.2, 0102 computer and information sciences, 02 engineering and technology, odd coloring, rank-width, 01 natural sciences, Parameterized complexity, Computer Science - Computational Complexity, 05C15, Computer Science - Data Structures and Algorithms, Mathematics - Combinatorics, F.2.2, Exponential Time Hypothesis, parameterized complexity

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/pdf/2002.06078
http://arxiv.org/abs/2002.06078
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03374591v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-03374591v1
https://doi.org/10.1007/s00453-021-00830-x
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02991977/document
https://link.springer.com/article/10.1007/s00453-021-00830-x
https://rd.springer.com/chapter/10.1007/978-3-030-60440-0_6
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02991977
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica83.html#BelmonteS21
https://hal.archives-ouvertes.fr/lirmm-02991977v1

EULER AND EXPONENTIAL ALGORITHM IN VISCOELASTIC ANALYSES OF LAMINATED GLASS

Autori: Alena Zemanová Jaroslav Schmidt

Zdroj: Acta Polytechnica CTU Proceedings, Vol 26, Iss 0, Pp 86-93 (2020)

Predmety: laminated glass, viscoelasticity, generalised maxwell model, exponential algorithm, euler method, TA1-2040, Engineering (General). Civil engineering (General)

Prístupová URL adresa: https://ojs.cvut.cz/ojs/index.php/APP/article/download/6393/5536
https://doaj.org/article/c2f5401b16d546589591eb3b7dcb337b

Quantum algorithms for one-sided crossing minimization

Autori: Caroppo, Susanna Da Lozzo, Giordano Di Battista, Giuseppe

Prispievatelia: Caroppo, Susanna Da Lozzo, Giordano Di Battista, Giuseppe

Predmety: Exact exponential algorithm, One-sided crossing minimization, Quantum divide and conquer, Quantum dynamic programming, Quantum graph drawing

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001540417500001; volume:1052; journal:THEORETICAL COMPUTER SCIENCE; https://hdl.handle.net/11590/517739

Dostupnosť: https://hdl.handle.net/11590/517739
https://doi.org/10.1016/j.tcs.2025.115424

Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification

Autori: Galby, Esther Kisfaludi-Bak, Sándor Marx, Dániel a ďalší

Prispievatelia: Galby, Esther Kisfaludi-Bak, Sándor Marx, Dániel a ďalší

Predmety: FOS: Computer and information sciences, Computer Science - Computational Complexity, F.2, Directed Steiner Network, Computer Science - Data Structures and Algorithms, Sub-exponential algorithm, Data Structures and Algorithms (cs.DS), ddc:004, Computational Complexity (cs.CC), 68Q25, 68Q27

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2208.06015
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.67
http://hdl.handle.net/21.11116/0000-000C-1E72-3
http://hdl.handle.net/21.11116/0000-000C-1E74-1
https://aaltodoc.aalto.fi/handle/123456789/129733

On distance-preserving elimination orderings in graphs: Complexity and algorithms: On distance-preserving elimination orderings in graphs: complexity and algorithms

Autori: Coudert, David Ducoffe, Guillaume Nisse, Nicolas a ďalší

Prispievatelia: Coudert, David Ducoffe, Guillaume Nisse, Nicolas a ďalší

Zdroj: Discrete Applied Mathematics. 243:140-153

Predmety: Exact exponential algorithm, Keyword: distance-preserving elimination ordering, graph theory, metric, metric graph theory, exact exponential algorithm, 0211 other engineering and technologies, Distance-preserving elimination ordering, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, integer linear programming, Bounded treewidth, Graph algorithms (graph-theoretic aspects), NP-complete, 2. Zero hunger, Connectivity, Integer linear programming, Metric graph theory, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Distance in graphs, distance-preserving elimination ordering, NP-completeness, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), bounded treewidth

Popis súboru: application/xml; application/pdf

Prístupová URL adresa: https://hal.inria.fr/hal-01741277/file/dpo-hal.pdf
https://zbmath.org/6872387
https://doi.org/10.1016/j.dam.2018.02.007
https://inria.hal.science/hal-01741277v1
https://inria.hal.science/hal-01741277v1/document
https://doi.org/10.1016/j.dam.2018.02.007
https://hal.inria.fr/hal-01741277/document
https://www.sciencedirect.com/science/article/pii/S0166218X18300520
https://dblp.uni-trier.de/db/journals/dam/dam243.html#CoudertDNS18
https://boa.unimib.it/handle/10281/220893
https://repositorio.uchile.cl/handle/2250/152628
https://hal.inria.fr/hal-01741277
https://hdl.handle.net/2434/961405
https://doi.org/10.1016/j.dam.2018.02.007
https://hdl.handle.net/10281/220893
https://doi.org/10.1016/j.dam.2018.02.007

An exact exponential branch-and-merge algorithm for the single machine total tardiness problem

Autori: Michele Garraffa Lei Shang Federico Della Croce a ďalší

Prispievatelia: Michele Garraffa Lei Shang Federico Della Croce a ďalší

Zdroj: Theoretical Computer Science. 745:133-149

Predmety: 0211 other engineering and technologies, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], Exact exponential algorithm, Single machine total tardiness, Branch and merge

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01477835/file/main.pdf
https://hal.archives-ouvertes.fr/hal-01932539
https://hal-univ-tours.archives-ouvertes.fr/hal-01477835v1
https://hal.archives-ouvertes.fr/hal-01477835/document
https://dblp.uni-trier.de/db/journals/tcs/tcs745.html#GarraffaSCT18
https://www.sciencedirect.com/science/article/pii/S0304397518304079
https://iris.polito.it/handle/11583/2768452
https://hal.science/hal-01932539v1
https://doi.org/10.1016/j.tcs.2018.05.040
https://hal.science/hal-01932539v1/document
https://hal.science/hal-01307265v1

Dimension degradation of fractionally spaced super‐exponential algorithm for sparse channel equalisation

Autori: Yi Zhou Feng Wang Heng Sun a ďalší

Zdroj: The Journal of Engineering (2019)

Predmety: cfoc, computational complexity, sparse channel equalisation, dimension degradation technique, blind equalisers, channel estimation, cross fourth-order cumulant, equalisers, 02 engineering and technology, higher order statistics, Engineering (General). Civil engineering (General), transient response, super-exponential algorithm, 0202 electrical engineering, electronic engineering, information engineering, high-order statistics, channel impulse response, prominent coefficients, fractionally, TA1-2040, modified fsse

Prístupová URL adresa: https://ietresearch.onlinelibrary.wiley.com/doi/pdfdirect/10.1049/joe.2019.0794
https://doaj.org/article/93194a709cfa4745ad1f49c9a5cf8263
https://digital-library.theiet.org/content/journals/10.1049/joe.2019.0794
https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/joe.2019.0794

'CRITICAL INTERSECTION OF MATHEMATICS AND SOCIAL POLICY'

Autori: Ms. Sanchita

Predmety: 4. Education, Epidemiology, Modelling, Exponential, Algorithm, Embedding

The Asymmetric Travelling Salesman Problem In Sparse Digraphs

Autori: Kowalik, Łukasz Majewski, Konrad Łukasz Kowalik and Konrad Majewski

Prispievatelia: Kowalik, Łukasz Majewski, Konrad Łukasz Kowalik and Konrad Majewski

Predmety: asymmetric traveling salesman problem, Hamiltonian cycle, sparse graphs, exponential algorithm

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 180, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.23

Dostupnosť: https://doi.org/10.4230/LIPIcs.IPEC.2020.23
https://nbn-resolving.org/urn:nbn:de:0030-drops-133269
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.23

Many Visits TSP Revisited

Autori: Kowalik, Łukasz Li, Shaohua Nadara, Wojciech a ďalší

Prispievatelia: Kowalik, Łukasz Li, Shaohua Nadara, Wojciech a ďalší

Predmety: many visits traveling salesman problem, exponential algorithm

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 173, 28th Annual European Symposium on Algorithms (ESA 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.66

Dostupnosť: https://doi.org/10.4230/LIPIcs.ESA.2020.66
https://nbn-resolving.org/urn:nbn:de:0030-drops-129329
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.66

Quantum Algorithms for One-Sided Crossing Minimization

Autori: Susanna Caroppo Giordano Da Lozzo Giuseppe Di Battista a ďalší

Prispievatelia: Susanna Caroppo Giordano Da Lozzo Giuseppe Di Battista a ďalší

Predmety: exact exponential algorithm, One-sided crossing minimization, quantum divide and conquer, quantum dynamic programming, quantum graph drawing

Relation: ispartofbook:Leibniz International Proceedings in Informatics, LIPIcs; 32nd International Symposium on Graph Drawing and Network Visualization, GD 2024; volume:320; serie:LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS; https://hdl.handle.net/11590/493418

Dostupnosť: https://hdl.handle.net/11590/493418
https://doi.org/10.4230/lipics.gd.2024.20

Hitting and Harvesting Pumpkins

Autori: Joret, Gwénaël Paul, Christophe Sau, Ignasi a ďalší

Prispievatelia: Joret, Gwénaël Paul, Christophe Sau, Ignasi a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783642237188

Predmety: FOS: Computer and information sciences, Single-exponential algorithm, single-exponential algorithm, Informatique générale, 05C85, 05C83, Graph minors, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], hitting and packing, G.2.2, 0102 computer and information sciences, Approximation algorithm, 01 natural sciences, Parameterized complexity, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Iterative compression, 13. Climate action, Informatique mathématique, Computer Science - Data Structures and Algorithms, Théorie des graphes, Data Structures and Algorithms (cs.DS), graph minors, iterative compression, Hitting and packing, approximation algorithm, parameterized complexity

Popis súboru: No full-text files

Prístupová URL adresa: http://arxiv.org/pdf/1105.2704
http://arxiv.org/abs/1105.2704
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00642341v1
https://doi.org/10.1007/978-3-642-23719-5_34
https://difusion.ulb.ac.be/vufind/Record/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/169101/Details
https://link.springer.com/chapter/10.1007%2F978-3-642-23719-5_34
https://link.springer.com/10.1007/978-3-642-23719-5_34
http://www.lirmm.fr/~sau/talks/Pumpkins.pdf
https://rd.springer.com/chapter/10.1007/978-3-642-23719-5_34
https://dblp.uni-trier.de/db/journals/corr/corr1105.html#abs-1105-2704
https://www.arxiv.org/abs/1105.2704
https://arxiv.org/pdf/1105.2704

Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility

Autori: Calamoneri T. Gastaldello M. Mary A. a ďalší

Prispievatelia: Calamoneri T. Gastaldello M. Mary A. a ďalší

Predmety: Chain subgraph cover problem, Cytoplasmic incompatibility, Enumeration algorithm, Exact exponential algorithm, Interval order

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000555090400001; volume:15; issue:1; firstpage:14; lastpage:29; numberofpages:16; journal:ALGORITHMS FOR MOLECULAR BIOLOGY; https://hdl.handle.net/11385/202459

Dostupnosť: https://hdl.handle.net/11385/202459
https://doi.org/10.1186/s13015-020-00174-1

Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion

Autori: Baste, Julien Faria, Luerbio Klein, Sulamita a ďalší

Prispievatelia: Baste, Julien Faria, Luerbio Klein, Sulamita a ďalší

Zdroj: Theory of Computing Systems. 61:777-794

Predmety: FOS: Computer and information sciences, Single-exponential algorithm, Graph modification problem, [MATH] Mathematics [math], G.2.2, F.2.2, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Parameterized complexity, Computer Science - Computational Complexity, Iterative compression, 68R10, 05C85, Computer Science - Data Structures and Algorithms, FPT-algorithm, Data Structures and Algorithms (cs.DS)

Prístupová URL adresa: http://arxiv.org/abs/1504.05515
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01630773v1
https://doi.org/10.1007/s00224-016-9716-y
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01630773
https://dblp.uni-trier.de/db/journals/corr/corr1504.html#BasteFKS15
https://link.springer.com/content/pdf/10.1007%2Fs00224-016-9716-y.pdf
https://ui.adsabs.harvard.edu/abs/2015arXiv150405515B/abstract
https://link.springer.com/article/10.1007/s00224-016-9716-y
https://arxiv.org/abs/1504.05515

Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem

Autori: Shang, Lei Garraffa, Michele Della Croce, Federico a ďalší

Prispievatelia: Shang, Lei Garraffa, Michele Della Croce, Federico a ďalší

Predmety: Exact exponential algorithm, Single machine total tardiness, Branch-and-merge

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 89, 12th International Symposium on Parameterized and Exact Computation (IPEC 2017); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.28

Dostupnosť: https://doi.org/10.4230/LIPIcs.IPEC.2017.28
https://nbn-resolving.org/urn:nbn:de:0030-drops-85468
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.28

A Satisfiability Algorithm for Synchronous Boolean Circuits

Autori: Hiroki MORIZUMI

Zdroj: IEICE Transactions on Information and Systems. 2021, E104.D(3):392

Exact and approximate bandwidth

Autori: Marek Cygan Marcin Pilipczuk

Zdroj: Lecture Notes in Computer Science ISBN: 9783642029264

Predmety: Bandwidth, Exact algorithm, Approximate algorithm, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Exponential algorithm, 01 natural sciences, Graph, Theoretical Computer Science, Computer Science(all)

Prístupová URL adresa: https://link.springer.com/10.1007/978-3-642-02927-1_26
https://link.springer.com/chapter/10.1007%2F978-3-642-02927-1_26
https://dblp.uni-trier.de/db/conf/icalp/icalp2009-1.html#CyganP09

On the Complexity of Computing Treelength

Autori: Daniel Lokshtanov

Zdroj: Lecture Notes in Computer Science ISBN: 9783540744559

Predmety: Exact exponential algorithm, Applied Mathematics, Graph treelength, 0211 other engineering and technologies, Discrete Mathematics and Combinatorics, Chordal sandwich problem, 0102 computer and information sciences, 02 engineering and technology, Approximation, 01 natural sciences, Inapproximability, NP-complete

Prístupová URL adresa: http://www.ii.uib.no/~daniello/papers/treelength.pdf
https://link.springer.com/chapter/10.1007/978-3-540-74456-6_26
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2007.html#Lokshtanov07
https://rd.springer.com/chapter/10.1007/978-3-540-74456-6_26
https://link.springer.com/10.1007/978-3-540-74456-6_26
https://www.sciencedirect.com/science/article/abs/pii/S0166218X09003941
https://www.sciencedirect.com/science/article/pii/S0166218X09003941
http://www.ii.uib.no/~daniello/papers/treelength.pdf
https://dblp.uni-trier.de/db/journals/dam/dam158.html#Lokshtanov10
https://core.ac.uk/display/82151165