Výsledky vyhledávání - "Exact exponential algorithm"

merging nodes in search trees an exact exponential algorithm for the single machine total tardiness scheduling problem

Autoři: Shang, Lei Garraffa, Michele Della Croce, Federico a další

Přispěvatelé: Shang, Lei Garraffa, Michele Della Croce, Federico a další

Témata: Exact exponential algorithm, Single machine total tardiness, Branch-and-merge, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2018/8546/
https://doi.org/10.4230/LIPIcs.IPEC.2017.28
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.28

Exact Exponential Algorithm for Distance-3 Independent Set Problem

Autoři: Katsuhisa YAMANAKA Shogo KAWARAGI Takashi HIRAYAMA

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

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem

Autoři: Ryuhei Uehara Yoshio Okamoto Takeaki Uno a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783642208768

Témata: 0209 industrial biotechnology, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem.

Autoři: Otachi, Yota Uehara, Ryuhei Uno, Takeaki a další

Témata: Spanning tree congestion, computational complexity, exponential time algorithm, Journal Article., VoR.

URL: http://hdl.handle.net/10119/10303
https://dspace.jaist.ac.jp/dspace/bitstream/10119/10303/1/17641.pdf

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem

Autoři: Okamoto, Yoshio Otachi, Yota Uehara, Ryuhei a další

Témata: Spanning tree congestion, chain graph, split graph, cograph, computational complexity, Journal Article, AM

URL: http://hdl.handle.net/10119/9861
https://dspace.jaist.ac.jp/dspace/bitstream/10119/9861/1/16956-1.pdf
https://doi.org/10.1007/978-3-642-20877-5_44
9783642208768
https://doi.org/10.1007/978-3-642-20877-5_44

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem

Zdroj: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. :452-462

Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem

Zdroj: Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem. 15(6):727-751

Hardness results and an Exact Exponential Algorithm for the . . .

Autoři: Yoshio Okamoto Yota Otachi Ryuhei Uehara a další

Přispěvatelé: Yoshio Okamoto Yota Otachi Ryuhei Uehara a další

Zdroj: http://www.emis.de/journals/JGAA/accepted/2011/OkamotoOtachiUeharaUno2011.15.6.pdf.

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.411.621; http://www.emis.de/journals/JGAA/accepted/2011/OkamotoOtachiUeharaUno2011.15.6.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.411.621
http://www.emis.de/journals/JGAA/accepted/2011/OkamotoOtachiUeharaUno2011.15.6.pdf

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

Autoři: Michele Garraffa Lei Shang Federico Della Croce a další

Přispěvatelé: Michele Garraffa Lei Shang Federico Della Croce a další

Zdroj: Theoretical Computer Science. 745:133-149

Témata: 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 souboru: application/pdf

Pří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

Autoři: Caroppo, Susanna Da Lozzo, Giordano Di Battista, Giuseppe

Přispěvatelé: Caroppo, Susanna Da Lozzo, Giordano Di Battista, Giuseppe

Témata: 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

Dostupnost: 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

Autoři: Coudert, David Ducoffe, Guillaume Nisse, Nicolas a další

Přispěvatelé: Coudert, David Ducoffe, Guillaume Nisse, Nicolas a další

Zdroj: Discrete Applied Mathematics. 243:140-153

Témata: 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 souboru: application/xml; application/pdf

Pří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

Quantum Algorithms for One-Sided Crossing Minimization

Autoři: Susanna Caroppo Giordano Da Lozzo Giuseppe Di Battista a další

Přispěvatelé: Susanna Caroppo Giordano Da Lozzo Giuseppe Di Battista a další

Témata: 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

Dostupnost: 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

Autoři: Calamoneri T. Gastaldello M. Mary A. a další

Přispěvatelé: Calamoneri T. Gastaldello M. Mary A. a další

Témata: 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

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

A Satisfiability Algorithm for Synchronous Boolean Circuits

Autoři: Hiroki MORIZUMI

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

On the Complexity of Computing Treelength

Autoři: Daniel Lokshtanov

Zdroj: Lecture Notes in Computer Science ISBN: 9783540744559

Témata: 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

Pří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

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

Autoři: ノルハズワニ, マド ユノス 永持, 仁 太田, 快人 a další

Přispěvatelé: ノルハズワニ, マド ユノス 永持, 仁 太田, 快人 a další

Témata: Traveling Salesman Problem, Exact Exponential Algorithm, Branch-and-reduce, Measure-and-conquer

Popis souboru: application/pdf

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

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

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

Autoři: Garraffa, Michele Shang, Lei Della Croce, Federico a další

Přispěvatelé: Garraffa, Michele Shang, Lei Della Croce, Federico a další

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

Témata: 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]

Dostupnost: 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

Autoři: DELLA CROCE DI DOJOLA, Federico GARRAFFA, MICHELE Shang, Lei a další

Přispěvatelé: DELLA CROCE DI DOJOLA, Federico GARRAFFA, MICHELE Shang, Lei a další

Témata: 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]

Pří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

Autoři: Aleksandar SHURBEVSKI Hiroaki SUTO Hiroshi NAGAMOCHI

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

Exact Algorithms via Monotone Local Search.

Autoři: FOMIN, FEDOR V. GASPERS, SERGE LOKSHTANOV, DANIEL a další

Zdroj: Journal of the ACM. Apr2019, Vol. 66 Issue 2, p1-23. 23p.

Témata: *ALGORITHMS, SUBSET selection, INTEGERS