| 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 | 2021-10-23 16:30 Computing the Longest Path Length Distribution Function of DAGs with Small Treewidth and Random Edge Lengths Ei Ando (Senshu Univ.)  COMP2021-20 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | Consider the problem of computing the longest path length in directed acyclic graphs (DAGs). It is well known that the problem can be solved efficiently when the edge lengths are static values. However, if we assume that the edge lengths are the mutually independent and uniformly distributed random variables, the problem is known to be $#P$-hard. Here we present a deterministic approximation algorithm for the problem. Given a DAG $G=(V,E)$ and that the treewidth of its underlying undirected graph is bounded by a constant $k$, then our algorithm finishes in $Oleft((3k+2)^2 nleft(frac{(6k+6)mn}{epsilon}right)^{9k^2+15k+6}right)$ time. Our algorithm is a fully polynomial time approximation scheme (FPTAS). |
|
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | #P-hard problem / DAG / longest path problem / FPTAS / / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 121, no. 218, COMP2021-20, pp. 39-46, Oct. 2021. | |
| Paper # | COMP2021-20 | |
| Date of Issue | 2021-10-16 (COMP) | |
| ISSN | 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 | COMP2021-20 |
|
| Conference Information | |
| Committee | COMP |
| Conference Date | 2021-10-23 - 2021-10-23 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Paper Information | |
| Registration To | COMP |
| Conference Code | 2021-10-COMP |
| Language | Japanese |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Computing the Longest Path Length Distribution Function of DAGs with Small Treewidth and Random Edge Lengths |
| Sub Title (in English) | |
| Keyword(1) | #P-hard problem |
| Keyword(2) | DAG |
| Keyword(3) | longest path problem |
| Keyword(4) | FPTAS |
| Keyword(5) | |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Ei Ando |
| 1st Author's Affiliation | Senshu University (Senshu 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 | () |
| Speaker | Author-1 |
| Date Time | 2021-10-23 16:30:00 |
| Presentation Time | 35 minutes |
| Registration for | COMP |
| Paper # | COMP2021-20 |
| Volume (vol) | vol.121 |
| Number (no) | no.218 |
| Page | pp.39-46 |
| #Pages | 8 |
| Date of Issue | 2021-10-16 (COMP) |
[Return to Top Page]