Presentation 2000/4/26
Generalized Online Independent Set Problems
Shiro Taketomi, Shuichi Miyazaki, Kazuo Iwama, Magnus M. Halldorsson,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) At each step of the online independent set problem, we are given a vertex and edges to the vertices previously given. We are reqired to decide whether we choose that vertex as a member of an independent set or not, before receiving the next vertex. In an ordinary setting of this problem, Halldorsson gave a tight upper and lower bound, n-1, of the competitive ratio. Also, he generalized the problem and gave a tight n/4 upper and lower bound. In this paper, we further extend the problem and give nontrivial upper and lower bounds.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) online problems / online algorithms / competitive ratio / online independent set problem
Paper # COMP2000-4
Date of Issue

Conference Information
Committee COMP
Conference Date 2000/4/26(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Generalized Online Independent Set Problems
Sub Title (in English)
Keyword(1) online problems
Keyword(2) online algorithms
Keyword(3) competitive ratio
Keyword(4) online independent set problem
1st Author's Name Shiro Taketomi
1st Author's Affiliation Graduate School of Informatics, Kyoto University()
2nd Author's Name Shuichi Miyazaki
2nd Author's Affiliation Graduate School of Informatics, Kyoto University
3rd Author's Name Kazuo Iwama
3rd Author's Affiliation Graduate School of Informatics, Kyoto University
4th Author's Name Magnus M. Halldorsson
4th Author's Affiliation Science Institute, University of Iceland:Taeknigardur University of Iceland
Date 2000/4/26
Paper # COMP2000-4
Volume (vol) vol.100
Number (no) 25
Page pp.pp.-
#Pages 8
Date of Issue