Paper Abstract and Keywords |
Presentation |
2011-03-09 15:30
Algorithms for Covering Digraphs by Length-Bounded Paths Kenji Sejima, Takuro Fukunaga, Hiroshi Nagamochi (Kyoto Univ.) COMP2010-53 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
In the length-bounded path cover problem, a digraph $D=(V,A)$ with a source $s\in V$, a sink $t\in V$, a non-negative arc-length $\ell$ and a non-negative integer $T$ are given, and we are asked to find a minimum size set of $st$-paths of length at most $T$ which cover all nodes in $V$.
In this paper, we present approximation algorithms to the problem with acyclic digraphs.
We also discuss NP-hardness and a polynomial-time exact algorithm for a special case of the problem. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Dilworth's theorem / length-bound / LP-rounding / path cover / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 110, no. 464, COMP2010-53, pp. 45-51, March 2011. |
Paper # |
COMP2010-53 |
Date of Issue |
2011-03-02 (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 |
COMP2010-53 |
Conference Information |
Committee |
COMP |
Conference Date |
2011-03-09 - 2011-03-09 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Chuo Univ. |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2011-03-COMP |
Language |
English (Japanese title is available) |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Algorithms for Covering Digraphs by Length-Bounded Paths |
Sub Title (in English) |
|
Keyword(1) |
Dilworth's theorem |
Keyword(2) |
length-bound |
Keyword(3) |
LP-rounding |
Keyword(4) |
path cover |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Kenji Sejima |
1st Author's Affiliation |
Kyoto University (Kyoto Univ.) |
2nd Author's Name |
Takuro Fukunaga |
2nd Author's Affiliation |
Kyoto University (Kyoto Univ.) |
3rd Author's Name |
Hiroshi Nagamochi |
3rd Author's Affiliation |
Kyoto University (Kyoto Univ.) |
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 |
2011-03-09 15:30:00 |
Presentation Time |
35 minutes |
Registration for |
COMP |
Paper # |
COMP2010-53 |
Volume (vol) |
vol.110 |
Number (no) |
no.464 |
Page |
pp.45-51 |
#Pages |
7 |
Date of Issue |
2011-03-02 (COMP) |
|