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

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

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

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

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

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

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

次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム

Autori: ノルハズワニ, マド ユノス 永持, 仁 太田, 快人 a ďalší

Prispievatelia: ノルハズワニ, マド ユノス 永持, 仁 太田, 快人 a ďalší

Predmety: Traveling Salesman Problem, Exact Exponential Algorithm, Branch-and-reduce, Measure-and-conquer

Popis súboru: application/pdf

Prístupová URL adresa: https://ndlsearch.ndl.go.jp/books/R100000039-I10376226

Degree: 博士(情報学) -- 京都大学, Kyoto University

Exact Exponential Algorithm for Distance-3 Independent Set Problem

Autori: Katsuhisa YAMANAKA Shogo KAWARAGI Takashi HIRAYAMA

Zdroj: IEICE Transactions on Information and Systems. 2019, E102.D(3):499

An Exact Exponential Branch-and-Merge Algorithm for the Single Machine Total Tardiness Problem

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

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

Zdroj: https://hal.science/hal-01477835 ; 2017.

Predmety: Exact exponential algorithm, Single machine total tardiness, Branch and merge, [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], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Dostupnosť: https://hal.science/hal-01477835
https://hal.science/hal-01477835v1/document
https://hal.science/hal-01477835v1/file/main.pdf

A branch-and-reduce exact algorithm for the single machine total tardiness problem

Autori: DELLA CROCE DI DOJOLA, Federico GARRAFFA, MICHELE Shang, Lei a ďalší

Prispievatelia: DELLA CROCE DI DOJOLA, Federico GARRAFFA, MICHELE Shang, Lei a ďalší

Predmety: branch and reduce, exact exponential algorithm, Exact Exponential Algorithms, Single Machine Total Tardiness Problem, Branch and Reduce, [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], single machine total tardiness, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC]

Prístupová URL adresa: https://hdl.handle.net/11583/2639564
https://hdl.handle.net/11583/2639557
https://hal.science/hal-01459797v1
https://hal.science/hal-01459752v1

The Stable Roommates Problem with Unranked Entries

Autori: Aleksandar SHURBEVSKI Hiroaki SUTO Hiroshi NAGAMOCHI

Zdroj: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2018, E101.A(9):1412

Distance-preserving orderings in graphs

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

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

Zdroj: https://inria.hal.science/hal-01393523 ; [Research Report] RR-8973, Inria Sophia Antipolis. 2016, pp.1-23.

Predmety: distance-preserving elimination ordering, metric graph theory, NP-complete, exact exponential algorithm, bounded treewidth, integer linear programming, graphes isométriques, Ordre d’élimination, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Dostupnosť: https://inria.hal.science/hal-01393523
https://inria.hal.science/hal-01393523v2/document
https://inria.hal.science/hal-01393523v2/file/dpo_RR2019%20%281%29.pdf

An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs

Autori: Aleksandar Shurbevski Hiroshi Nagamochi Norhazwani Md Yunos

Zdroj: Journal of Information Processing. 2017, 25:639

On the minimum feedback vertex set problem: exact and enumeration algorithms

Autori: Fedor V. Fomin Serge Gaspers Artem V. Pyatkin a ďalší

Prispievatelia: Fedor V. Fomin Serge Gaspers Artem V. Pyatkin a ďalší

Zdroj: http://www.dim.uchile.cl/%7Esgaspers/papers/FVS.pdf.

Predmety: Minimum feedback vertex set, maximum induced forest, exact exponential algorithm, number of

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.168.5581; http://www.dim.uchile.cl/%7Esgaspers/papers/FVS.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.168.5581
http://www.dim.uchile.cl/%7Esgaspers/papers/FVS.pdf

REPORTS IN INFORMATICS

Autori: Fedor V. Fomin Kjartan Høie The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Fedor V. Fomin Kjartan Høie The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.ii.uib.no/publikasjoner/texrap/pdf/2005-298.pdf.

Predmety: Treewidth, pathwidth, cubic graph, exact exponential algorithm, maximum independent set

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.9570

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.9570
http://www.ii.uib.no/publikasjoner/texrap/pdf/2005-298.pdf

Pathwidth of cubic graphs and exact algorithms

Autori: Fedor V. Fomin The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Fedor V. Fomin The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.ii.uib.no/publikasjoner/texrap/ps/2005-298.ps.

Predmety: Treewidth, pathwidth, cubic graph, exact exponential algorithm, maximum independent set, max-cut, minimum dominating set

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.3486

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.3486
http://www.ii.uib.no/publikasjoner/texrap/ps/2005-298.ps

Exact algorithms for treewidth and minimum fill-in

Autori: Fedor V. Fomin Ioan Todinca Dieter Kratsch a ďalší

Prispievatelia: Fedor V. Fomin Ioan Todinca Dieter Kratsch a ďalší

Zdroj: http://www.ii.uib.no/~fomin/fedor/articles1/exactTW_r7.pdf.

Predmety: Exact exponential algorithm, treewidth, fill-in, minimal separators, potential maximal clique, minimal

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.3538; http://www.ii.uib.no/~fomin/fedor/articles1/exactTW_r7.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.3538
http://www.ii.uib.no/~fomin/fedor/articles1/exactTW_r7.pdf

A branch-and-reduce exact algorithm for the single machine total tardiness problem

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

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

Zdroj: 45ème Conférence de la Société Italienne de Recherche Opérationnelle (AIRO 2015)
https://hal.science/hal-01459797
45ème Conférence de la Société Italienne de Recherche Opérationnelle (AIRO 2015), Sep 2015, Pise, Italy

Predmety: single machine total tardiness, exact exponential algorithm, branch and reduce, [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], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Geografické téma: Pise, Italy

Dostupnosť: https://hal.science/hal-01459797