Suchergebnisse - Output-polynomial algorithms

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

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

Enumerating minimal dominating sets in chordal bipartite graphs von 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 …”
Volltext

Computational aspects of monotone dualization: A brief survey von 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 …”
Volltext

On the Enumeration of Minimal Dominating Sets and Related Notions von 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 …”
Volltext

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width von 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 …”
Volltext

New Results on Monotone Dualization and Generating Hypergraph Transversals von 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 …”
Volltext

An output-polynomial time algorithm to determine all supported efficient solutions for multi-objective integer network flow problems von 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) …”
Volltext

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

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

Generating all maximal models of a Boolean expression von 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 …”
Volltext

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

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

On the hardness of inclusion-wise minimal separators enumeration von 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 …”
Volltext

An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem von 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 …”
Volltext

The negative cycles polyhedron and hardness of checking some polyhedral properties von 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 …”
Volltext

Efficiently enumerating hitting sets of hypergraphs arising in data profiling von 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 …”
Volltext

Finding Optimal Solutions for Voting Game Design Problems von 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 …”
Volltext

Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width von 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 …”
Volltext

Class Relevant Pattern Mining in Output-Polynomial Time von 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 …”
Volltext

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

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

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

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

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

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