|
Vol.E83-D No.3
pp.407-417
INVITED SURVEY PAPER
Graph Algorithms
Graph Coloring Algorithms
Xiao ZHOU, Takao NISHIZEKI, |
|
Summary | Full Text:PDF | |
|
Vol.E83-D No.3
pp.418-427
INVITED SURVEY PAPER
Algorithms for Geometric Problems
Effective Use of Geometric Information for Clustering and Related Topics
Tetsuo ASANO, |
|
Summary | Full Text:PDF | |
|
Vol.E83-D No.3
pp.428-437
INVITED SURVEY PAPER
Algorithms for Geometric Problems
Structures of Triangulations of Points
Keiko IMAI, |
|
Summary | Full Text:PDF | |
|
Vol.E83-D No.3
pp.438-446
INVITED SURVEY PAPER
Algorithms for Geometric Problems
Finding an Optimal Region in One- and Two-Dimensional Arrays
Naoki KATOH, |
|
Summary | Full Text:PDF | |
|
Vol.E83-D No.3
pp.447-454
INVITED SURVEY PAPER
Algorithms for Geometric Problems
How to Make Geometric Algorithms Robust
Kokichi SUGIHARA, |
|
Summary | Full Text:PDF | |
|
Vol.E83-D No.3
pp.455-461
INVITED SURVEY PAPER
Algorithms for Geometric Problems
Approximation Algorithms for Geometric Optimization Problems
Hisao TAMAKI, |
|
Summary | Full Text:PDF | |
|
Vol.E83-D No.3
pp.462-479
INVITED SURVEY PAPER
Approximate Algorithms for Combinatorial Problems
Designing High-Quality Approximation Algorithms for Combinatorial Optimization Problems
Takao ASANO, Kenichiro IWAMA, Hideyuki TAKADA, Yoshiko YAMASHITA, |
|
Summary | Full Text:PDF | |
|
Vol.E83-D No.3
pp.480-487
INVITED SURVEY PAPER
Approximate Algorithms for Combinatorial Problems
Approximation Algorithms for Submodular Set Cover with Applications
Toshihiro FUJITO, |
|
Summary | Full Text:PDF | |
|
Vol.E83-D No.3
pp.488-495
INVITED SURVEY PAPER
Approximate Algorithms for Combinatorial Problems
Approximation Algorithms for MAX SAT
Tomio HIRATA, Takao ONO, |
|
Summary | Full Text:PDF | |
|
Vol.E83-D No.3
pp.496-502
INVITED SURVEY PAPER
Approximate Algorithms for Combinatorial Problems
Approximation Algorithms for Scheduling Problems
Hiroaki ISHII, Minoru TADA, |
|
Summary | Full Text:PDF | |
|
Current List: 33511 - 33520
|