Name
Title | ||
|---|---|---|
An Algorithm for Finding a Region with the Minimum Lotal L1 from Prescribed Terminals |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/3-540-63890-3_35 | ISAAC |
Keywords | Field | DocType |
prescribed terminals,minimum lotal l1 | Line segment,Binary logarithm,Discrete mathematics,Polygon,Combinatorics,Vertex (geometry),Shortest path problem,Computational geometry,Algorithm,Feasible region,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-63890-3 | 5 | 0.54 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoshiyuki Kusakari | 1 | 10 | 3.34 |
| Takao Nishizeki | 2 | 1771 | 267.08 |