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 2016-09-06 11:30
On the inapproximability of the Frobenius problem and its relationship with the covering radius problem
Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2016-16
Abstract (in Japanese) (See Japanese page) 
(in English) Given coprime positive integers $a_1,cdots,a_n$, we call the problem that asks the maximum integer among all positive integers that cannot be represented as nonnegative integer combinations of $a_1,cdots,a_n$ the Frobenius problem. In this paper, we investigate the inapproximability of the Frobenius problem mainly by discussing a formula between a covering radius and the Frobenius number due to Kannan. Little research has been done on the inapproximability of the Frobenius problem although the computational complexity for deterministic algorithms has been known.
Keyword (in Japanese) (See Japanese page) 
(in English) Frobenius problem / inapproximability / approximation algorithm / covering radius / computational complexity / / /  
Reference Info. IEICE Tech. Rep., vol. 116, no. 211, COMP2016-16, pp. 15-16, Sept. 2016.
Paper # COMP2016-16 
Date of Issue 2016-08-30 (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 COMP2016-16

Conference Information
Committee COMP  
Conference Date 2016-09-06 - 2016-09-06 
Place (in Japanese) (See Japanese page) 
Place (in English) Toyama Prefectural University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2016-09-COMP 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) On the inapproximability of the Frobenius problem and its relationship with the covering radius problem 
Sub Title (in English)  
Keyword(1) Frobenius problem  
Keyword(2) inapproximability  
Keyword(3) approximation algorithm  
Keyword(4) covering radius  
Keyword(5) computational complexity  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Shunichi Matsubara  
1st Author's Affiliation Aoyama Gakuin University (Aoyama Gakuin 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 2016-09-06 11:30:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2016-16 
Volume (vol) vol.116 
Number (no) no.211 
Page pp.15-16 
#Pages
Date of Issue 2016-08-30 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


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