Výsledky vyhledávání - "Exact Exponential Algorithms"

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ší

Zdroj: Theoretical Computer Science. 1052:115424

Témata: FOS: Computer and information sciences, Quantum Physics, quantum graph drawing, Exact exponential algorithms, One-sided crossing minimization, Quantum divide and conquer, Quantum dynamic programming, Quantum graph drawing, quantum divide and conquer, FOS: Physical sciences, Computer Science - Data Structures and Algorithms, exact exponential algorithms, Data Structures and Algorithms (cs.DS), quantum dynamic programming, ddc:004, Quantum Physics (quant-ph)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2409.01942
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.20
https://hdl.handle.net/11590/493418
https://doi.org/10.4230/lipics.gd.2024.20

Solving Target Set Selection with Bounded Thresholds Faster than $$2^n$$

Autoři: Ivan Bliznets Danil Sagunov Ivan Bliznets and Danil Sagunov

Přispěvatelé: Ivan Bliznets Danil Sagunov Ivan Bliznets and Danil Sagunov

Zdroj: Algorithmica

Témata: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, exact exponential algorithms, target set, Data Structures and Algorithms (cs.DS), ddc:004, irreversible conversions of graphs, bootstrap percolation, social influence, vertex thresholds

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/1807.10789
http://drops.dagstuhl.de/opus/volltexte/2019/10223/pdf/LIPIcs-IPEC-2018-22.pdf
https://drops.dagstuhl.de/opus/volltexte/2019/10223/pdf/LIPIcs-IPEC-2018-22.pdf
https://paperity.org/p/191434762/solving-target-set-selection-with-bounded-thresholds-faster-than-2-n
https://dblp.uni-trier.de/db/journals/corr/corr1807.html#abs-1807-10789
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.22

Matching (Multi)Cut: Algorithms, Complexity, and Enumeration

Autoři: C. M. Gomes, Guilherme Juliano, Emanuel Martins, Gabriel a další

Přispěvatelé: C. M. Gomes, Guilherme Juliano, Emanuel Martins, Gabriel a další

Témata: FOS: Computer and information sciences, Enumeration, Matching Multicut, Exact exponential algorithms, Computer Science - Data Structures and Algorithms, Matching Cut, Data Structures and Algorithms (cs.DS), ddc:004, Parameterized Complexity

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2407.02898
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2024.25

CNF Satisfiability in a Subspace and Related Problems

Autoři: V. Arvind Venkatesan Guruswami Vikraman Arvind and Venkatesan Guruswami

Přispěvatelé: V. Arvind Venkatesan Guruswami Vikraman Arvind and Venkatesan Guruswami

Zdroj: Algorithmica. 84:3276-3299

Témata: FOS: Computer and information sciences, CNF Satisfiability, Exact exponential algorithms, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, ddc:004, 01 natural sciences, Hardness results

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2108.05914
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.5

Exact and Approximate Digraph Bandwidth

Autoři: Jain, Pallavi Kanesh, Lawqueen Lochet, William a další

Přispěvatelé: Jain, Pallavi Kanesh, Lawqueen Lochet, William a další

Zdroj: Leibniz International Proceedings in Informatics
18:1-18:15

Témata: digraph bandwidth, approximation scheme, directed bandwidth, exact exponential algorithms, ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2019/11580/pdf/LIPIcs-FSTTCS-2019-18.pdf/
https://research.iitj.ac.in/publication/exact-and-approximate-digraph-bandwidth
https://bora.uib.no/bora-xmlui/handle/11250/2720915
https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2019.html#0001KL0S19
https://drops.dagstuhl.de/opus/volltexte/2019/11580/
https://doi.org/10.4230/LIPIcs.FSTTCS.2019.18
https://hdl.handle.net/11250/2720915
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.18

CNF Satisfiability in a Subspace and Related Problems

Autoři: Arvind, Vikraman Guruswami, Venkatesan Vikraman Arvind and Venkatesan Guruswami

Přispěvatelé: Arvind, Vikraman Guruswami, Venkatesan Vikraman Arvind and Venkatesan Guruswami

Témata: CNF Satisfiability, Exact exponential algorithms, Hardness results

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 214, 16th International Symposium on Parameterized and Exact Computation (IPEC 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.5

Dostupnost: https://doi.org/10.4230/LIPIcs.IPEC.2021.5
https://nbn-resolving.org/urn:nbn:de:0030-drops-153886
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.5

Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility

Autoři: Tiziana Calamoneri Mattia Gastaldello Arnaud Mary a další

Zdroj: Algorithms for Molecular Biology, Vol 15, Iss 1, Pp 1-16 (2020)

Témata: Cytoplasmic incompatibility, Chain subgraph cover problem, Enumeration algorithms, Exact exponential algorithms, Interval order, Biology (General), QH301-705.5, Genetics, QH426-470

Popis souboru: electronic resource

Relation: http://link.springer.com/article/10.1186/s13015-020-00174-1; https://doaj.org/toc/1748-7188

Přístupová URL adresa: https://doaj.org/article/172ae2fabceb4cc8ab06b9d069dea69a

Exact and Approximate Digraph Bandwidth

Autoři: Jain, Pallavi Kanesh, Lawqueen Lochet, William a další

Přispěvatelé: Jain, Pallavi Kanesh, Lawqueen Lochet, William a další

Témata: directed bandwidth, digraph bandwidth, approximation scheme, exact exponential algorithms

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 150, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.18

Dostupnost: https://doi.org/10.4230/LIPIcs.FSTTCS.2019.18
https://nbn-resolving.org/urn:nbn:de:0030-drops-115802
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.18

Exact exponential algorithms to find tropical connected sets of minimum size

Autoři: Chapelle, Mathieu Cochefert, Manfred Kratsch, Dieter a další

Přispěvatelé: Chapelle, Mathieu Cochefert, Manfred Kratsch, Dieter a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783319135236

Témata: Informatique générale, 13. Climate action, Informatique mathématique, Exact exponential algorithms, 0206 medical engineering, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Colored graphs, Graphs, 7. Clean energy, 01 natural sciences, Algorithms

Popis souboru: 1 full-text file(s): application/pdf; No full-text files

Přístupová URL adresa: https://hal.science/hal-01105083v1
https://doi.org/10.1007/978-3-319-13524-3_13
https://link.springer.com/chapter/10.1007/978-3-319-13524-3_13
https://rd.springer.com/chapter/10.1007/978-3-319-13524-3_13
https://hal.archives-ouvertes.fr/hal-01105083
https://dblp.uni-trier.de/db/conf/iwpec/ipec2014.html#ChapelleCKLL14
https://difusion.ulb.ac.be/vufind/Record/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/192338/Details
https://dblp.uni-trier.de/db/journals/tcs/tcs676.html#ChapelleCKLL17
https://www.sciencedirect.com/science/article/pii/S0304397517301883#!
https://hal.archives-ouvertes.fr/hal-01971120
https://difusion.ulb.ac.be/vufind/Record/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/255579/Details
https://core.ac.uk/display/84359306
https://www.sciencedirect.com/science/article/pii/S0304397517301883

Efficient Algorithms for the max k -vertex cover Problem

Autoři: DELLA CROCE DI DOJOLA, Federico V. T.h. Paschos

Zdroj: Lecture Notes in Computer Science ISBN: 9783642334740

Témata: max k-vertex cover problem, Measure-and-conquer, Exact exponential algorithms, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Recherche opérationnelle, 7. Clean energy, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2F978-3-642-33475-7_21.pdf
https://basepub.dauphine.psl.eu/bitstream/123456789/6307/3/max_vertex_k-coveragecah_2.pdf
https://link.springer.com/content/pdf/10.1007/s10878-012-9575-7.pdf
https://dblp.uni-trier.de/db/journals/jco/jco28.html#CroceP14
https://www.archives-ouvertes.fr/hal-01511883v1
https://hal.archives-ouvertes.fr/hal-01511883v1
https://rd.springer.com/chapter/10.1007%2F978-3-642-33475-7_21
https://basepub.dauphine.fr/handle/123456789/6307
https://link.springer.com/article/10.1007%2Fs10878-012-9575-7
https://iris.polito.it/handle/11583/2562755
https://hdl.handle.net/11583/2562755
https://doi.org/10.1007/s10878-012-9575-7

MP or not MP: that is the question

Autoři: DELLA CROCE DI DOJOLA, Federico

Zdroj: Journal of Scheduling. 19:33-42

Témata: 2. Zero hunger, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Modeling, Machine scheduling, Approximation, Exact exponential algorithms, 01 natural sciences

Přístupová URL adresa: https://link.springer.com/content/pdf/10.1007%2Fs10951-015-0459-4.pdf
https://iris.polito.it/handle/11583/2661623
https://ideas.repec.org/a/spr/jsched/v19y2016i1d10.1007_s10951-015-0459-4.html
https://link.springer.com/article/10.1007/s10951-015-0459-4
https://EconPapers.repec.org/RePEc:spr:jsched:v:19:y:2016:i:1:d:10.1007_s10951-015-0459-4
https://dblp.uni-trier.de/db/journals/scheduling/scheduling19.html#Croce16
http://link.springer.com/article/10.1007/s10951-015-0459-4
https://doi.org/10.1007/s10951-015-0459-4
https://hdl.handle.net/11583/2661623

On Maximal Chain Subgraphs and Covers of Bipartite Graphs

Autoři: Calamoneri, Tiziana Gastaldello, Mattia Mary, Arnaud a další

Přispěvatelé: Calamoneri, Tiziana Gastaldello, Mattia Mary, Arnaud a další

Zdroj: Lecture Notes in Computer Science ; Combinatorial Algorithms - 27th International Workshop, IWOCA 2016 ; https://inria.hal.science/hal-01388546 ; Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Aug 2016, Helsinki, Finland. pp.137-150, ⟨10.1007/978-3-319-44543-4_11⟩

Témata: Exact exponential algorithms, Enumeration Algorithms, Chain Subgraph Cover Problem, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM]

Geografické téma: Helsinki, Finland

Dostupnost: https://inria.hal.science/hal-01388546
https://inria.hal.science/hal-01388546v1/document
https://inria.hal.science/hal-01388546v1/file/PaperIWOCA2016.pdf
https://doi.org/10.1007/978-3-319-44543-4_11

Finding Large Set Covers Faster via the Representation Method

Autoři: Nederlof, Jesper Jesper Nederlof

Přispěvatelé: Nederlof, Jesper Jesper Nederlof

Témata: Set Cover, Exact Exponential Algorithms, Fine-Grained Complexity

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 57, 24th Annual European Symposium on Algorithms (ESA 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.69

Dostupnost: https://doi.org/10.4230/LIPIcs.ESA.2016.69
https://nbn-resolving.org/urn:nbn:de:0030-drops-64114
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.69

Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3

Autoři: Razgon, I

Zdroj: Journal of Discrete Algorithms. 7:191-212

Témata: Parameterized complexity, Vertex cover, Computational Theory and Mathematics, Exact exponential algorithms, 0211 other engineering and technologies, Discrete Mathematics and Combinatorics, Maximum independent set, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science

Popis souboru: metadata

Přístupová URL adresa: https://core.ac.uk/display/41999129
https://www.sciencedirect.com/science/article/pii/S1570866708000695
https://www.sciencedirect.com/science/article/abs/pii/S1570866708000695
http://www.sciencedirect.com/science/article/pii/S1570866708000695
https://eprints.bbk.ac.uk/id/eprint/7925
https://dblp.uni-trier.de/db/journals/jda/jda7.html#Razgon09

Largest chordal and interval subgraphs faster than 2n

Autoři: Bliznets, Ivan Fomin, Fedor Pilipczuk, Michal Pawel a další

Témata: Exact exponential algorithms, Chordal graphs, Interval graphs, Maximum induced Π-subgraph, VDP::Matematikk og Naturvitenskap: 400

Popis souboru: application/pdf

Relation: https://hdl.handle.net/1956/11779; cristin:1283900

Dostupnost: https://hdl.handle.net/1956/11779
https://doi.org/10.1007/s00453-015-0054-2

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

Largest Chordal and Interval Subgraphs Faster Than 2 n

Autoři: Bliznets, Ivan Fomin, Fedor Pilipczuk, Michal Pawel a další

Zdroj: Lecture Notes in Computer Science ISBN: 9783642404498
Lecture Notes in Computer Science
Proceedings of the 21st Annual European Symposium on Algorithms (ESA 2013)

Témata: FOS: Computer and information sciences, Chordal graphs, Exact exponential algorithms, Computer Science - Data Structures and Algorithms, Interval graphs, Data Structures and Algorithms (cs.DS), VDP::Matematikk og Naturvitenskap: 400, Maximum induced Π-subgraph, Matematikk og Naturvitenskap: 400 [VDP]

Popis souboru: application/pdf

Přístupová URL adresa: https://bora.uib.no/bora-xmlui/bitstream/1956/11779/4/art%25253A10.1007%25252Fs00453-015-0054-2.pdf
http://arxiv.org/abs/1311.4055
https://link.springer.com/10.1007/978-3-642-40450-4_17
https://link.springer.com/chapter/10.1007/978-3-642-40450-4_17
https://dblp.uni-trier.de/db/conf/esa/esa2013.html#BliznetsFPV13
https://rd.springer.com/chapter/10.1007%2F978-3-642-40450-4_17
https://core.ac.uk/display/24979803
http://dblp.uni-trier.de/db/conf/esa/esa2013.html#BliznetsFPV13
https://hdl.handle.net/1956/11779

Exponential time algorithms via separators and random subsets

Autoři: Lee, Edward

Témata: Exact Exponential Algorithms, Parameterized Algorithms, Random Algorithms

Popis souboru: application/pdf

Relation: http://hdl.handle.net/1959.4/71134; https://doi.org/10.26190/unsworks/22740

Dostupnost: http://hdl.handle.net/1959.4/71134
https://unsworks.unsw.edu.au/bitstreams/9c387be6-f034-41c0-b04c-be4ccd42d212/download
https://doi.org/10.26190/unsworks/22740

Combinatorial bounds via measure and conquer: Boundings minimal dominating sets and applications

Autoři: Fedor V. Fomin Fabrizio Grandoni Artem V. Pyatkin a další

Přispěvatelé: Fedor V. Fomin Fabrizio Grandoni Artem V. Pyatkin a další

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

Témata: Categories and Subject Descriptors, F.2.2 [Analysis Of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, G.2.2 [Mathematics of Computing, Discrete Mathematics—Graph algorithms, Network problems General Terms, Algorithms, Theory Additional Key Words and Phrases, exact exponential algorithms, listing algorithms, measure and conquer, minimum dominating set, minimum set cover, domatic number

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.328
http://www.ii.uib.no/~fomin/fedor/articles1/domnum.pdf

Boundling the Number of Minimal . . .

Autoři: Fedor V. Fomin Fabrizio Grandoni Artem V. Pyatkin a další

Přispěvatelé: Fedor V. Fomin Fabrizio Grandoni Artem V. Pyatkin a další

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

Témata: exact (exponential) algorithms, minimum dominating set, minimum set cover, domatic number, weighted dominating set

Popis souboru: application/postscript

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.59
http://www.ii.uib.no/publikasjoner/texrap/ps/2005-309.ps