메뉴 건너뛰기




Volumn 3623, Issue , 2005, Pages 388-396

Approximation results for the weighted P4 partition problems

Author keywords

3 length chain; Approximation algorithms; Differential approximation; Graph partition; Performance ratio; Standard approximation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY;

EID: 26844486284     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11537311_34     Document Type: Conference Paper
Times cited : (3)

References (14)
  • 1
    • 33646440993 scopus 로고    scopus 로고
    • Approximations for minimum and min-max vehicle routing problems
    • article in press
    • Arkin, E. M., Hassin, R. and Levin, A.: Approximations for minimum and min-max vehicle routing problems. J. of Algorithms, (article in press)
    • J. of Algorithms
    • Arkin, E.M.1    Hassin, R.2    Levin, A.3
  • 3
    • 84995344698 scopus 로고
    • Structure preserving reductions among convex optimization problems
    • Ausiello, G., D'Atri, A., Protasi, M.: Structure preserving reductions among convex optimization problems. J. Comput. System Sci. 21 (1980) 136-153
    • (1980) J. Comput. System Sci. , vol.21 , pp. 136-153
    • Ausiello, G.1    D'Atri, A.2    Protasi, M.3
  • 4
    • 0000011818 scopus 로고
    • The complexity of approximating a nonlinear program
    • Bellare, M., Rogaway, P.: The complexity of approximating a nonlinear program. Mathematical Programming 69 (1995) 429-441
    • (1995) Mathematical Programming , vol.69 , pp. 429-441
    • Bellare, M.1    Rogaway, P.2
  • 5
    • 0030143697 scopus 로고    scopus 로고
    • On an approximation measure founded on the links between optimization and polynomial approximation theory
    • Demange, M., Paschos, V. Th.: On an approximation measure founded on the links between optimization and polynomial approximation theory. Theoretical Computer Science 158 (1996) 117-141
    • (1996) Theoretical Computer Science , vol.158 , pp. 117-141
    • Demange, M.1    Paschos, V.Th.2
  • 9
    • 0042174519 scopus 로고    scopus 로고
    • An approximation algorithm for maximum packing of 3-edge paths
    • Hassin, R., Rubinstein, S.: An Approximation Algorithm for Maximum Packing of 3-Edge Paths. Information Processing Letters 63 (1997) 63-67
    • (1997) Information Processing Letters , vol.63 , pp. 63-67
    • Hassin, R.1    Rubinstein, S.2
  • 10
    • 26844491363 scopus 로고    scopus 로고
    • An approximation algorithm for maximum triangle packing
    • ESA
    • Hassin, R., Rubinstein, S.: An Approximation Algorithm for Maximum Triangle Packing. ESA, LNCS 3221 (2004) 403-413
    • (2004) LNCS , vol.3221 , pp. 403-413
    • Hassin, R.1    Rubinstein, S.2
  • 11
    • 0037097074 scopus 로고    scopus 로고
    • Differential approximation results for the traveling salesman and related problems
    • Monnot, J.: Differential approximation results for the traveling salesman and related problems. Information Processing Letters 82 (2002) 229-235
    • (2002) Information Processing Letters , vol.82 , pp. 229-235
    • Monnot, J.1
  • 14
    • 4544278109 scopus 로고    scopus 로고
    • On the k-path partition of graphs
    • Steiner, G.: On the k-path partition of graphs. Theoretical Computer Science 290 (2003) 2147-2155
    • (2003) Theoretical Computer Science , vol.290 , pp. 2147-2155
    • Steiner, G.1


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