Finding hidden independent sets in interval graphs

Authors:
Therese Biedl;Broňa Brejová;Erik D. Demaine;Angèle M. Hamel;Alejandro López-Ortiz;Tomáš Vinař
Affiliations:
School of Computer Science, University of Waterloo, Waterloo, ON, Canada;MIT Laboratory for Computer Science, Cambridge, MA;Department of Physics and Computing, Wilfrid Laurier University, Waterloo, ON, Canada;Department of Physics and Computing, Wilfrid Laurier University, Waterloo, ON, Canada;School of Computer Science, University of Waterloo, Waterloo, ON, Canada;School of Computer Science, University of Waterloo, Waterloo, ON, Canada
Venue:
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Year:
2003

Citing 7
Cited 0

Searching and pebbling

Theoretical Computer Science
The complexity of coloring games on perfect graphs

Theoretical Computer Science
Adaptive set intersections, unions, and differences

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
An optimal procedure for gap closing in whole genome shotgun sequencing

RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Optimal aggregation algorithms for middleware

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Construction of probe interval models

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider a game in a given set of intervals (and their implied interval graph G) in which the adversary chooses an independent set X in G. The goal is to discover this hidden independent set X by making the fewest queries of the form "Is point p covered by an interval in X?" Our interest in this problem stems from two applications: experimental gene discovery and the game of Battleship (in a 1-dimensional setting). We provide adaptive algorithms for both the verification scenario (given an independent set, is it X?) and the discovery scenario (find X without any information). Under some assumptions, these algorithms use an asymptotically optimal number of queries in every instance.