IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2015-04-23 13:40
Approximability of width parameters
Koichi Yamazaki (Gunma Univ.) COMP2015-2
Abstract (in Japanese) (See Japanese page) 
(in English) Wu et al. showed that for several graph width parameters including treewidth, pathwidth, and cutwidth, there is no polynomial time approximation algorithm with any constant approximation factor under the Small Set Expansion (SSE) hypothesis [Wu, Austrin, Pitassi, and Liu, Inapproximability of treewidth and related problems. J. Artif. Intell. Res., Vol.49, 2014].

In this article, based on the method of Wu et al., we give more simple SSE hardness reductions which cover a wide range of graph width parameters including not only treewidth, pathwidth, and cutwidth, but also carvingwidth, rankwidth and cliquewidth. By the simple reductions, we show in a unified manner that it is SSE hard to approximate the graph width parameters to within any constant factor.
Keyword (in Japanese) (See Japanese page) 
(in English) treewidth / pathwidth / cutwidth / carvingwidth / cliquewidth / rankwidth / SSE hypothesis / inapproximability  
Reference Info. IEICE Tech. Rep., vol. 115, no. 15, COMP2015-2, pp. 9-13, April 2015.
Paper # COMP2015-2 
Date of Issue 2015-04-16 (COMP) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF COMP2015-2

Conference Information
Committee COMP  
Conference Date 2015-04-23 - 2015-04-23 
Place (in Japanese) (See Japanese page) 
Place (in English)  
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2015-04-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Approximability of width parameters 
Sub Title (in English)  
Keyword(1) treewidth  
Keyword(2) pathwidth  
Keyword(3) cutwidth  
Keyword(4) carvingwidth  
Keyword(5) cliquewidth  
Keyword(6) rankwidth  
Keyword(7) SSE hypothesis  
Keyword(8) inapproximability  
1st Author's Name Koichi Yamazaki  
1st Author's Affiliation Gunma University (Gunma Univ.)
2nd Author's Name  
2nd Author's Affiliation ()
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2015-04-23 13:40:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2015-2 
Volume (vol) vol.115 
Number (no) no.15 
Page pp.9-13 
#Pages
Date of Issue 2015-04-16 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan