Smoothed analysis of three combinatorial problems

被引：0
|
作者：
Banderier, C
Beier, R
Mehlhorn, K
机构：
[1] Univ Paris 13, Inst Galilee, Lab Informat Paris Nord, F-93430 Villetaneuse, France
[2] Max Planck Inst Informat, D-66123 Saarbrucken, Germany
来源：
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS | 2003年 / 2747卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Smoothed analysis combines elements over worst-case and average case analysis. For an instance x, the smoothed complexity is the average complexity of an instance obtained from x by a perturbation. The smoothed complexity of a problem is the worst smoothed complexity of any instance. Spielman and Teng introduced this notion for continuous problems. We apply the concept to combinatorial problems and study the smoothed complexity of three classical discrete problems: quicksort, left-to-right maxima counting, and shortest paths.
引用
收藏
页码：198 / 207
页数：10
相关论文
共 50 条
  • [21] An Improved Modal Analysis for Three-Dimensional Problems using Face-Based Smoothed Finite Element Method
    Zhicheng He
    Guangyao Li
    Zhihua Zhong
    Aiguo Cheng
    Guiyong Zhang
    Eric Li
    Acta Mechanica Solida Sinica, 2013, 26 : 140 - 150
  • [22] AN IMPROVED MODAL ANALYSIS FOR THREE-DIMENSIONAL PROBLEMS USING FACE-BASED SMOOTHED FINITE ELEMENT METHOD
    Zhicheng He
    Guangyao Li
    Zhihua Zhong
    Aiguo Cheng
    Guiyong Zhang
    Eric Li
    Acta Mechanica Solida Sinica, 2013, 26 (02) : 140 - 150
  • [23] Smoothed Online Combinatorial Optimization Using Imperfect Predictions
    Wang, Kai
    Song, Zhao
    Theocharous, Georgios
    Mahadevan, Sridhar
    THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 10, 2023, : 12130 - 12137
  • [24] COMBINATORIAL PROBLEMS
    PENDZICK, J
    DR DOBBS JOURNAL, 1995, 20 (10): : 12 - 12
  • [25] COMBINATORIAL PROBLEMS
    CHOWLA, S
    RYSER, HJ
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1950, 2 (01): : 93 - 99
  • [26] Smoothed aggregation for Helmholtz problems
    Olson, Luke N.
    Schroder, Jacob B.
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2010, 17 (2-3) : 361 - 386
  • [27] COMBINATORIAL OPTIMIZATION PROBLEMS IN THE ANALYSIS AND DESIGN OF PROBABILISTIC NETWORKS
    BAUER, D
    BOESCH, F
    SUFFEL, C
    TINDELL, R
    NETWORKS, 1985, 15 (02) : 257 - 271
  • [28] ANALYSIS OF A COMBINATORIAL APPROACH TO FLOWSHOP SCHEDULING PROBLEMS.
    Gupta, Jatinder N.D.
    Operational Research Quarterly, 1975, 26 (2 ii): : 431 - 440
  • [29] Guest Editorial: Combinatorial Problems and Algorithms in Image Analysis
    Barneva, Reneta P.
    Brimkov, Valentin E.
    Wiederhold, Petra
    INTERNATIONAL JOURNAL OF IMAGING SYSTEMS AND TECHNOLOGY, 2011, 21 (01) : 1 - 2
  • [30] PROBABILISTIC ANALYSIS OF ALGORITHMS FOR SOME COMBINATORIAL OPTIMIZATION PROBLEMS
    GAZMURI, PG
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1986, 87 : 113 - 126
12345