메뉴 건너뛰기




Volumn 3709 LNCS, Issue , 2005, Pages 358-372

Maintaining longest paths in cyclic graphs

Author keywords

[No Author keywords available]

Indexed keywords

CYCLIC GRAPHS; INCREMENTAL ALGORITHMS; SCHEDULING APPLICATIONS; WORST-CASE COMPLEXITY;

EID: 33646165929     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_28     Document Type: Conference Paper
Times cited : (1)

References (16)
  • 2
    • 29344437801 scopus 로고    scopus 로고
    • Iterative flattening: A scalable method for solving multi-capacity scheduling problems
    • July
    • A. Cesta, A. Oddi, and S. Smith. Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems. In AAAI-00, July 2000.
    • (2000) AAAI-00
    • Cesta, A.1    Oddi, A.2    Smith, S.3
  • 4
    • 34250074609 scopus 로고
    • Applying tabu search to the job-shop scheduling problem
    • M. Dell'Amico and M. Trubian. Applying Tabu Search to the Job-Shop Scheduling Problem. Annals of Operations Research, 41:231-252, 1993.
    • (1993) Annals of Operations Research , vol.41 , pp. 231-252
    • Dell'Amico, M.1    Trubian, M.2
  • 5
    • 64849109521 scopus 로고
    • Theoretical improvements in algorithmic efficiency for network flow problems
    • J. Edmonds and R.M. Karp. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. JACM, 34:596-615, 1972.
    • (1972) JACM , vol.34 , pp. 596-615
    • Edmonds, J.1    Karp, R.M.2
  • 6
    • 0023384210 scopus 로고
    • Fibonacci heaps and their uses in improved network optimization algorithms
    • M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach., 34:596-615, 1987.
    • (1987) J. Assoc. Comput. Mach. , vol.34 , pp. 596-615
    • Fredman, M.L.1    Tarjan, R.E.2
  • 7
    • 17444402223 scopus 로고    scopus 로고
    • Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
    • Nice, France
    • I. Katriel. Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights. In CP-AI-OR'04, Nice, France, 2004.
    • (2004) CP-AI-OR'04
    • Katriel, I.1
  • 9
    • 0037302545 scopus 로고    scopus 로고
    • Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results
    • P. Laborie. Algorithms for Propagating Resource Constraints in AI Planning and Scheduling: Existing Approaches and New Results. Artificial Intelligence, 143(2):151-188, 2003.
    • (2003) Artificial Intelligence , vol.143 , Issue.2 , pp. 151-188
    • Laborie, P.1
  • 10
    • 26444526552 scopus 로고    scopus 로고
    • Maintaining longest path incrementally
    • Cork, Ireland
    • L. Michel and P. Van Hentenryck. Maintaining Longest Path Incrementally. In CP'03, pages 540-554, Cork, Ireland, 2003.
    • (2003) CP'03 , pp. 540-554
    • Michel, L.1    Van Hentenryck, P.2
  • 11
    • 13444254458 scopus 로고    scopus 로고
    • Iterative relaxations for iterative flattening in cumulative scheduling
    • Whistler, British Columbia
    • L. Michel and P. Van Hentenryck. Iterative Relaxations for Iterative Flattening in Cumulative Scheduling. In ICAPS'04, Whistler, British Columbia, 2004.
    • (2004) ICAPS'04
    • Michel, L.1    Van Hentenryck, P.2
  • 12
    • 5244278595 scopus 로고    scopus 로고
    • A fast taboo search algorithm for the job shop problem
    • E. Nowicki and C. Smutnicki. A Fast Taboo Search Algorithm for the Job Shop Problem. Management Science, 42(6):797-813, 1996.
    • (1996) Management Science , vol.42 , Issue.6 , pp. 797-813
    • Nowicki, E.1    Smutnicki, C.2
  • 14
    • 0030146097 scopus 로고    scopus 로고
    • On the computational complexity of dynamic graph problems
    • G. Ramalingam and T. Reps. On the Computational Complexity of Dynamic Graph Problems. Theoretical Computer Science, 158:233-277, 1996.
    • (1996) Theoretical Computer Science , vol.158 , pp. 233-277
    • Ramalingam, G.1    Reps, T.2


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