An efficient implementation of a joint generation algorithm

E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

2 Scopus citations

Abstract

Let C be an n-dimensional integral box, and TT be a monotone property defined over the elements of C. We consider the problems of incrementally generating jointly the families Fπ and Gπ of all minimal subsets satisfying property π and all maximal subsets not satisfying property π, when π is given by a polynomial-time satisfiability oracle. Problems of this type arise in many practical applications. It is known that the above joint generation problem can be solved in incremental quasi-polynomial time. In this paper, we present an efficient implementation of this procedure. We present experimental results to evaluate our implementation for a number of interesting monotone properties π.

Original languageBritish English
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsCelso C. Ribeiro, Simone L. Martins
PublisherSpringer Verlag
Pages114-128
Number of pages15
ISBN (Print)3540220674, 9783540220671
DOIs
StatePublished - 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3059
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'An efficient implementation of a joint generation algorithm'. Together they form a unique fingerprint.

Cite this