Suchergebnisse - "Output polynomial-time algorithm"

Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices

Autoren: Elbassioni, Khaled Makino, Kazuhisa Khaled Elbassioni and Kazuhisa Makino

Weitere Verfasser: Elbassioni, Khaled Makino, Kazuhisa Khaled Elbassioni and Kazuhisa Makino

Schlagwörter: Totally unimodular matrices, Vertices of polyhedra, Vertex enumeration, Hypergraph transversals, Hypergraph decomposition, Output polynomial-time algorithm

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 101, 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.18

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.SWAT.2018.18
https://nbn-resolving.org/urn:nbn:de:0030-drops-88441
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.18

Enumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices

Autoren: Elbassioni, Khaled Makino, Kazuhisa Khaled Elbassioni and Kazuhisa Makino

Weitere Verfasser: Elbassioni, Khaled Makino, Kazuhisa Khaled Elbassioni and Kazuhisa Makino

Schlagwörter: FOS: Computer and information sciences, Totally unimodular matrices, 0211 other engineering and technologies, Vertex enumeration, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Vertices of polyhedra, Hypergraph transversals, Hypergraph decomposition, Output polynomial-time algorithm, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/1707.03914
https://dblp.uni-trier.de/db/journals/corr/corr1707.html#ElbassioniM17
https://arxiv.org/abs/1707.03914
https://ui.adsabs.harvard.edu/abs/2017arXiv170703914E/abstract
https://drops.dagstuhl.de/opus/volltexte/2018/8844/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.18

Polynomially solvable cases of hypergraph transversal and related problems ; Polynomialzeitlösbare Klassen des Transversalhypergraphen-Problems und verwandte Probleme

Autoren: Rauf, Imran Mehlhorn, Kurt

Weitere Verfasser: Rauf, Imran Mehlhorn, Kurt

Schlagwörter: ddc:004, Graph, Effizienter Algorithmus, Algorithmus, Boolesche Funktion, Transversalhypergraphen-Problem, monotone boolesche funktion, Mengensystem, hypergraph transversal problem, enumeration algorithms, output polynomial time algorithm

Relation: hdl:20.500.11880/26252

Verfügbarkeit: http://nbn-resolving.org/urn:nbn:de:bsz:291-scidok-44713
https://doi.org/10.22028/D291-26196

Polynomially solvable cases of hypergraph transversal and related problems

Autoren: Rauf, Imran Mehlhorn, Kurt

Weitere Verfasser: Rauf, Imran Mehlhorn, Kurt

Verfügbarkeit: http://data.europeana.eu/aggregation/europeana/2048441/item_IBF2554K2K4GLAVMCOCYX5CVDJ4OXGV3
http://data.europeana.eu/item/2048441/item_IBF2554K2K4GLAVMCOCYX5CVDJ4OXGV3

Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices

Autoren: Khaled Elbassioni and Kazuhisa Makino Elbassioni, Khaled Makino, Kazuhisa

Index Begriffe: Totally unimodular matrices, Vertices of polyhedra, Vertex enumeration, Hypergraph transversals, Hypergraph decomposition, Output polynomial-time algorithm, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2018.18
Is Part Of LIPIcs, Volume 101, 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018)