Search Results - Output-polynomial algorithm

An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems by Könen, David, Stiglmayr, Michael

“…). It derives an output-polynomial time algorithm to determine all supported efficient solutions for MOIMCF problems…”
Get full text

On the Enumeration of Minimal Dominating Sets and Related Notions by Kanté, Mamadou Moustapha, Limouzy, Vincent, Mary, Arnaud, Nourine, Lhouari

“… As a consequence there exists an output-polynomial time algorithm for the Trans-Enum problem if and only…”
Get full text

Computational aspects of monotone dualization: A brief survey by Eiter, Thomas, Makino, Kazuhisa, Gottlob, Georg

“… [On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms 21 (1996) 618–628], which showed that the problem is solvable in quasi-polynomial time…”
Get full text

Enumerating minimal dominating sets in chordal bipartite graphs by Golovach, Petr A., Heggernes, Pinar, Kanté, Mamadou M., Kratsch, Dieter, Villanger, Yngve

“…We show that all minimal dominating sets of a chordal bipartite graph can be generated in incremental polynomial, hence output polynomial, time…”
Get full text

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width by Golovach, Petr A., Heggernes, Pinar, Kanté, Mamadou Moustapha, Kratsch, Dieter, Sæther, Sigve H., Villanger, Yngve

“… In this paper we study output-polynomial enumeration algorithms on graphs of bounded LMIM-width and graphs of bounded local LMIM-width…”
Get full text

An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems by Könen, David, Stiglmayr, Michael

“…This paper addresses the problem of enumerating all supported efficient solutions for a linear multi-objective integer minimum cost flow problem (MOIMCF)…”
Get full text

New Results on Monotone Dualization and Generating Hypergraph Transversals by Eiter, Thomas, Gottlob, Georg, Makino, Kazuhisa

“…) whose associated decision problem is a prominent open problem in NP-completeness. We present a number of new polynomial time, respectively, output-polynomial time…”
Get full text

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time by Eppstein, David

“… in the output size, by filtering the output of simple backtracking algorithms for non-crossing paths or surrounding cycles respectively…”
Get full text

Generating all maximal models of a Boolean expression by Kavvadias, Dimitris J., Sideri, Martha, Stavropoulos, Elias C.

“… We present an output-polynomial algorithm for the 2CNF case and we show that the problem cannot be solved in output-polynomial time in the case of Horn expressions, unless P…”
Get full text

On the hardness of inclusion-wise minimal separators enumeration by Brosse, Caroline, Defrain, Oscar, Kurita, Kazuhiro, Limouzy, Vincent, Uno, Takeaki, Wasa, Kunihiro

“…Enumeration problems are often encountered as key subroutines in the exact computation of graph parameters such as chromatic number, treewidth, or treedepth…”
Get full text

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time by Eppstein, David

“… in the output size, by filtering the output of simple backtracking algorithms for non-crossing paths or surrounding cycles respectively…”
Get full text

An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem by Halffmann, Pascal, Dietz, Tobias, Przybylski, Anthony, Ruzika, Stefan

“… The resulting algorithm runs in output polynomial time, i.e. its running time is polynomial in the encoding length of both the input and output…”
Get full text

Efficiently enumerating hitting sets of hypergraphs arising in data profiling by Bläsius, Thomas, Friedrich, Tobias, Lischeid, Julius, Meeks, Kitty, Schirneck, Martin

“… If the solutions have bounded size, Eiter and Gottlob [SICOMP'95] gave an algorithm running in output-polynomial time, but whose space requirement also scales with the output…”
Get full text

The negative cycles polyhedron and hardness of checking some polyhedral properties by Boros, Endre, Elbassioni, Khaled, Gurvich, Vladimir, Tiwary, Hans Raj

“… (Discrete Comput. Geom. 39(1–3):174–190, 2008 ), we show that, unless P = NP , there is no output polynomial-time algorithm to generate all the vertices of a 0/1-polyhedron…”
Get full text

Finding Optimal Solutions for Voting Game Design Problems by De Keijzer, B., Klos, T. B., Zhang, Y.

“…In many circumstances where multiple agents need to make a joint decision, voting is used to aggregate the agents' preferences. Each agent's vote carries a…”
Get full text

Identifying the Minimal Transversals of a Hypergraph and Related Problems by Eiter, Thomas, Gottlob, Georg

“…The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance…”
Get full text

Class Relevant Pattern Mining in Output-Polynomial Time by Grosskreutz, Henrik

“… In this paper, we investigate new properties of the relevant patterns and develop, thereupon, the first algorithm whose runtime is polynomial in the size of the input and output…”
Get full text

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width by Golovach, Petr A, Heggernes, Pinar, Kanté, Mamadou Moustapha, Kratsch, Dieter, Sæther, Sigve H, Villanger, Yngve

“… In this paper we study output-polynomial enumeration algorithms on graphs of bounded LMIM-width and graphs of bounded local LMIM-width…”
Get full text

An iterative algorithm for simulation error based identification of polynomial input-output models using multi-step prediction by Farina, Marcello, Piroddi, Luigi

“…Effective identification of polynomial input-output models for applications requiring long-range prediction or simulation performance relies on both careful…”
Get full text

Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries by Domingo, Carlos, Mishra, Nina, Pitt, Leonard

“… We give an incremental output polynomial time algorithm for exact learning both the read-k CNF…”
Get full text