SCOPUS 정보 검색 플랫폼

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3162, Issue , 2004, Pages 200-212

The minimum weight triangulation problem with few inner points

(2) Hoffmann, Michael a Okamoto, Yoshio a

a ETH ZURICH (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY; OPTIMIZATION; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION; SURVEYING; TRIANGULATION;

CONVEX POLYGON; EXACT ALGORITHMS; FIXED-PARAMETER ALGORITHMS; GEOMETRIC OPTIMIZATION; INTERIOR POINT; MINIMUM WEIGHT TRIANGULATION; POLYNOMIAL-TIME; SIMPLE POLYGON;

DYNAMIC PROGRAMMING;

EID: 35048830825 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/978-3-540-28639-4_18 Document Type: Article

Times cited : (13)

References (17)

1
- 0032639348
- The path of a triangulation
- O. Aichholzer: The path of a triangulation. Proc. 15th SoCG (1999) 14-23.
- (1999) Proc. 15th SoCG , pp. 14-23
- Aichholzer, O.¹

2
- 35248889929
- The zigzag path of a pseudotriangulation
- O. Aichholzer, G. Rote, B. Speckmann and I. Streinu: The zigzag path of a pseudotriangulation. Proc. 8th WADS, Lect. Notes Comput. Sci. 2748 (2003) 377-388.
- (2003) Proc. 8th WADS, Lect. Notes Comput. Sci. , vol.2748 , pp. 377-388
- Aichholzer, O.¹ Rote, G.² Speckmann, B.³ Streinu, I.⁴

3
- 38249000218
- Polynomial-time instances of the minimum weight triangulation problem
- E. Anagnostou and D. Cornell: Polynomial-time instances of the minimum weight triangulation problem. Comput. Geom. 3 (1993) 247-259.
- (1993) Comput. Geom. , vol.3 , pp. 247-259
- Anagnostou, E.¹ Cornell, D.²

4
- 0036972011
- Diamonds are not a minimum weight triangulation's best friend. Internat
- P. Bose, L. Devroye and W. Evans: Diamonds are not a minimum weight triangulation's best friend. Internat. J. Comput. Geom. Appl. 12 (2002) 445-453.
- (2002) J. Comput. Geom. Appl. , vol.12 , pp. 445-453
- Bose, P.¹ Devroye, L.² Evans, W.³

5
- 0034918920
- On ß-skeleton as a subgraph of the minimum weight triangulation
- S.-W. Cheng and Y.-F. Xu: On ß-skeleton as a subgraph of the minimum weight triangulation. Theor. Comput. Sci. 262 (2001) 459-471.
- (2001) Theor. Comput. Sci. , vol.262 , pp. 459-471
- Cheng, S.-W.¹ Xu, Y.-F.²

6
- 35048874911
- The traveling salesman problem with few inner points
- To appear
- V.G. Deǐneko, M. Hoffmann, Y. Okamoto and G.J. Woeginger: The traveling salesman problem with few inner points. Proc. 10th COCOON, Lect. Notes Comput. Sei. 3106 (2004). To appear.
- (2004) Proc. 10th COCOON, Lect. Notes Comput. Sei. , vol.3106
- Deǐneko, V.G.¹ Hoffmann, M.² Okamoto, Y.³ Woeginger, G.J.⁴

7
- 0003706269
- Springer, Berlin
- R.G. Downey and M.R. Fellows: Parameterized Complexity. Springer, Berlin, 1999.
- (1999) Parameterized Complexity
- Downey, R.G.¹ Fellows, M.R.²

8
- 0004127488
- W.H. Freeman & Company
- M. Garey and D. Johnson: Computers and Intractability. W.H. Freeman & Company, 1979.
- (1979) Computers and Intractability
- Garey, M.¹ Johnson, D.²

9
- 0003415254
- Master Thesis, University of Illinois, Urbana
- P.D. Gilbert: New results in planar triangulations. Master Thesis, University of Illinois, Urbana, 1979.
- (1979) New Results in Planar Triangulations
- Gilbert, P.D.¹

10
- 21044431562
- A constant-factor approximation for maximum weight triangulation
- S. Hu: A constant-factor approximation for maximum weight triangulation. Proc. 15th CCCG (2003) 150-154.
- (2003) Proc. 15th CCCG , pp. 150-154
- Hu, S.¹

11
- 84896999511
- A branch-and-cut approach for minimum weight triangulation
- Y. Kyoda, K. Imai, F. Takeuchi, and A. Tajima: A branch-and-cut approach for minimum weight triangulation. Proc. 8th ISAAC, Lect. Notes Comput. Sci. 1350 (1997) 384-393.
- (1997) Proc. 8th ISAAC, Lect. Notes Comput. Sci. , vol.1350 , pp. 384-393
- Kyoda, Y.¹ Imai, K.² Takeuchi, F.³ Tajima, A.⁴

12
- 0000775283
- Minimal triangulations of polygonal domains
- G. Klincsek: Minimal triangulations of polygonal domains. Annals Discrete Math. 9 (1980) 121-123.
- (1980) Annals Discrete Math. , vol.9 , pp. 121-123
- Klincsek, G.¹

13
- 0006936254
- Quasi-greedy triangulations approximating the minimum weight triangulation
- C. Levcopoulos and D. Krznaric: Quasi-greedy triangulations approximating the minimum weight triangulation. J. Algor. 27 (1998) 303-338.
- (1998) J. Algor. , vol.27 , pp. 303-338
- Levcopoulos, C.¹ Krznaric, D.²

14
- 26844566791
- Habilitation Thesis, Universität Tübingen
- R. Niedermeier: Invitation to fixed-parameter algorithms. Habilitation Thesis, Universität Tübingen, 2002.
- (2002) Invitation to Fixed-parameter Algorithms
- Niedermeier, R.¹

15
- 85032346047
- Geometric intersection problems
- M.I. Shamos and D. Hoey: Geometric intersection problems. Proc. 17th FOCS (1976) 208-215.
- (1976) Proc. 17th FOCS , pp. 208-215
- Shamos, M.I.¹ Hoey, D.²

16
- 0033574360
- Maximum weight triangulation and graph drawing
- C.A. Wang, F.Y. Chin, and B.T. Yang: Maximum weight triangulation and graph drawing. Inform. Proccess. Lett. 70 (1999) 17-22.
- (1999) Inform. Proccess. Lett. , vol.70 , pp. 17-22
- Wang, C.A.¹ Chin, F.Y.² Yang, B.T.³

17
- 0347140625
- A lower bound for ß-skeleton belonging to minimum weight triangulations
- C.A. Wang and B. Yang: A lower bound for ß-skeleton belonging to minimum weight triangulations. Comput. Geom. 19 (2001) 35-46.
- (2001) Comput. Geom. , vol.19 , pp. 35-46
- Wang, C.A.¹ Yang, B.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.