Information and Systems-Theoretical Foundations of Computing(Date:2003/04/18)

Presentation
表紙

,  

[Date]2003/4/18
[Paper #]
目次

,  

[Date]2003/4/18
[Paper #]
Online Knapsack Problem For Exchangeable Items

Shingo MASANISHI,  Kazuo IWAMA,  

[Date]2003/4/18
[Paper #]COMP2003-1
Performance Analysis of a Greedy Algorithm for Inferring Boolean Functions

Daiji FUKAGAWA,  Tatsuya AKUTSU,  

[Date]2003/4/18
[Paper #]COMP2003-2
Constructing Families of ε-Approximate k-Wise Independent Permutations

Toshiya ITO,  Yoshinori TAKEI,  

[Date]2003/4/18
[Paper #]COMP2003-3
Augmenting Node-to-Area Connectivity under Local Edge-Connectivity Requirements Based on Areas

Masayuki HAGIWARA,  Toshimasa ISHII,  Hiroshi NAGAMOCHI,  

[Date]2003/4/18
[Paper #]COMP2003-4
A Simple and Robust Algorithm for Bisecting a Triconnected Graph with Two Resource Sets

Hiroshi NAGAMOCH,  Kengo IWATA,  Toshimasa ISHII,  

[Date]2003/4/18
[Paper #]COMP2003-5
(2-2/(|V|))-Approximation Algorrithms for Several Graph Connectivity Related Problems

Makoto TAMURA,  Satoshi TAOKA,  Toshimasa WATANABE,  

[Date]2003/4/18
[Paper #]COMP2003-6
Experimental Evaluation of Node-Variable Selection Rules in PC Cluster-based Parallel Branch-and-Bound Algorithms

Satoshi TAOKA,  Toshimasa WATANABE,  

[Date]2003/4/18
[Paper #]COMP2003-7
Fast Algorithms for Enumerating Cliques in Huge Graphs

Takeaki UNO,  

[Date]2003/4/18
[Paper #]COMP2003-8
複写される方へ

,  

[Date]2003/4/18
[Paper #]
奥付

,  

[Date]2003/4/18
[Paper #]