Presentation | 2014/11/13 Online Steiner Trees on Outerplanar Graphs AKIRA MATSUBAYASHI, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | This report addresses the classical online Steiner tree problem on edge-weighted graphs. It is known that a greedy (nearest neighbor) online algorithm is O(log n)-competitive on arbitrary graphs with n nodes. It is also known that no deterministic algorithm is better than Ω(log n)-competitive even for series-parallel graphs. The greedy algorithm is trivially 1- and 2-competitive for trees and rings, respectively, but Ω(log n)-competitive even for outerplanar graphs. No other nontrivial class of graphs that admits constant competitive deterministic Steiner tree algorithms has been known. In this report, we propose an 8-competitive deterministic algorithm for outerplanar graphs. Our algorithm connects a requested node to a previous node using a path that is constant times longer than a shortest path between the nodes. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Steiner Tree / outerplanar graph / online algorithm / competitive analysis |
Paper # | Vol.2014-AL-150 No.8 |
Date of Issue |
Conference Information | |
Committee | MSS |
---|---|
Conference Date | 2014/11/13(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 | Mathematical Systems Science and its applications(MSS) |
---|---|
Language | ENG |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Online Steiner Trees on Outerplanar Graphs |
Sub Title (in English) | |
Keyword(1) | Steiner Tree |
Keyword(2) | outerplanar graph |
Keyword(3) | online algorithm |
Keyword(4) | competitive analysis |
1st Author's Name | AKIRA MATSUBAYASHI |
1st Author's Affiliation | Division of Electrical Engineering and Computer Science, Kanazawa University() |
Date | 2014/11/13 |
Paper # | Vol.2014-AL-150 No.8 |
Volume (vol) | vol.114 |
Number (no) | 313 |
Page | pp.pp.- |
#Pages | 4 |
Date of Issue |