SCOPUS 정보 검색 플랫폼

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

Volumn 4957 LNCS, Issue , 2008, Pages 329-338

A polyhedral investigation of the LCS problem and a repetition-free variant

(4) Fernandes, Cristina G a Ferreira, Carlos E a Tjandraatmadja, Christian a Wakabayashi, Yoshiko a

a UNIVERSITY OF SÃO PAULO (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; GRAPH THEORY; MATHEMATICAL PROGRAMMING; POLYNOMIAL APPROXIMATION; SEPARATION;

BRANCH AND CUT ALGORITHM; POLYHEDRAL INVESTIGATION; BRANCH-AND-CUT ALGORITHMS; COMMON SUBSEQUENCE; COMPUTATIONAL RESULTS; DYNAMIC PROGRAMMING ALGORITHMS; FACET-DEFINING INEQUALITIES; FACIAL STRUCTURES; INFORMATICS; LATIN AMERICAN; LONGEST COMMON SUBSEQUENCE PROBLEM; PERFECT GRAPHS; POLYNOMIAL-TIME; POLYTOPE;

PROBLEM SOLVING; SYSTEMS ENGINEERING;

EID: 43049118971 PISSN: 03029743 EISSN: 16113349 Source Type: Book Series
DOI: 10.1007/978-3-540-78773-0_29 Document Type: Conference Paper

Times cited : (5)

References (9)

1
- 43049143667
- Repetition-free longest common subsequence
- to appear
- Adi, S.S., Braga, M., Fernandes, C.G., Ferreira, C.E., Martinez, F.H.V., Sagot, M.-F., Stefanes, M.A., Tjandraatmadja, C., Wakabayashi, Y.: Repetition-free longest common subsequence. In: Proc. IV Latin-American Algorithms, Graphs and Optimization Symposium (to appear) (2007)
- (2007) Proc. IV Latin-American Algorithms, Graphs and Optimization Symposium
- Adi, S.S.¹ Braga, M.² Fernandes, C.G.³ Ferreira, C.E.⁴ Martinez, F.H.V.⁵ Sagot, M.-F.⁶ Stefanes, M.A.⁷ Tjandraatmadja, C.⁸ Wakabayashi, Y.⁹

2
- 33746589837
- Exemplar longest common subsequence
- Alexandrov, V.N, van Albada, G.D, Sloot, P.M.A, Dongarra, J, eds, ICCS, Springer, Heidelberg
- Bonizzoni, P., Della Vedova, G., Dondi, R., Fertin, G., Vialette, S.: Exemplar longest common subsequence. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2006. LNCS, vol. 3992, pp. 622-629. Springer, Heidelberg (2006)
- (2006) LNCS , vol.3992 , pp. 622-629
- Bonizzoni, P.¹ Della Vedova, G.² Dondi, R.³ Fertin, G.⁴ Vialette, S.⁵

3
- 0002716241
- On certain polytopes associated with graphs
- Chvátal, V.: On certain polytopes associated with graphs. J. Combinatorial Theory Ser. B 18, 138-154 (1975)
- (1975) J. Combinatorial Theory Ser. B , vol.18 , pp. 138-154
- Chvátal, V.¹

4
- 0004116989
- 2nd edn. MIT Press, Cambridge
- Gormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
- (2001) Introduction to Algorithms
- Gormen, T.H.¹ Leiserson, C.E.² Rivest, R.L.³ Stein, C.⁴

5
- 0005388824
- Anti-blocking polyhedra
- Fulkerson, D.R.: Anti-blocking polyhedra. J. Combinatorial Theory Ser. B 12, 50-71 (1972)
- (1972) J. Combinatorial Theory Ser. B , vol.12 , pp. 50-71
- Fulkerson, D.R.¹

6
- 51249185617
- The ellipsoid method and its consequences in combinatorial optimization
- Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1, 169-197 (1981)
- (1981) Combinatorica , vol.1 , pp. 169-197
- Grötschel, M.¹ Lovász, L.² Schrijver, A.³

7
- 0003957164
- Springer, Heidelberg
- Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)
- (1988) Geometric Algorithms and Combinatorial Optimization
- Grötschel, M.¹ Lovász, L.² Schrijver, A.³

8
- 49649140846
- Normal hypergraphs and the perfect graph conjecture
- Lovász, L.: Normal hypergraphs and the perfect graph conjecture. Discrete Math. 2(3), 253-267 (1972)
- (1972) Discrete Math , vol.2 , Issue.3 , pp. 253-267
- Lovász, L.¹

9
- 0033391532
- Genome rearrangement with gene families
- Sankoff, D.: Genome rearrangement with gene families. Bioinforniatics 15(11), 909-917 (1999)
- (1999) Bioinforniatics , vol.15 , Issue.11 , pp. 909-917
- Sankoff, D.¹

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