タグgreedy-algorithms - これはページ5です - GeneraCodice

Minimum total waiting time for arrivals/durations

https://www.generacodice.com/jp/articolo/2451848/minimum-total-waiting-time-for-arrivals-durations
  optimization  -  np-complete  -  dynamic-programming  -  greedy-algorithms
cs.stackexchange cs.stackexchange

Coloring a graph with odd number of vertices with $k$ (which is close to $\Delta$) colors in linear time

https://www.generacodice.com/jp/articolo/2448823/coloring-a-graph-with-odd-number-of-vertices-with-k-which-is-close-to-delta-colors-in-linear-time
  time-complexity  -  greedy-algorithms  -  graphs  -  colorings
cs.stackexchange cs.stackexchange

欲張りアルゴリズムの最適性

https://www.generacodice.com/jp/articolo/2447790/欲張りアルゴリズムの最適性
  greedy-algorithms  -  proof-techniques  -  correctness-proof
cs.stackexchange cs.stackexchange

特定の配列から作ることができる特定のサイズの類似グループの最大数

https://www.generacodice.com/jp/articolo/2447626/特定の配列から作ることができる特定のサイズの類似グループの最大数
  dynamic-programming  -  greedy-algorithms  -  mathematical-analysis  -  algorithm-design
cs.stackexchange cs.stackexchange

この貪欲なアルゴリズムがロッド切断問題で失敗する理由

https://www.generacodice.com/jp/articolo/2444608/この貪欲なアルゴリズムがロッド切断問題で失敗する理由
  dynamic-programming  -  algorithms  -  greedy-algorithms
cs.stackexchange cs.stackexchange

固定数の重みを持つナップザック

https://www.generacodice.com/jp/articolo/2443714/固定数の重みを持つナップザック
  greedy-algorithms  -  knapsack-problems
cs.stackexchange cs.stackexchange

目標合計を得るために2つの配列からの要素を選択する

https://www.generacodice.com/jp/articolo/2443290/目標合計を得るために2つの配列からの要素を選択する
  arrays  -  dynamic-programming  -  algorithms  -  greedy-algorithms
cs.stackexchange cs.stackexchange

Determine aproximation factor in a greedy algorithm

https://www.generacodice.com/jp/articolo/2443140/determine-aproximation-factor-in-a-greedy-algorithm
  linear-programming  -  algorithms  -  greedy-algorithms  -  knapsack-problems
cs.stackexchange cs.stackexchange

You have K amoebas and one amoeba can divide into A,B,C amoebas after one instruction then find the minimum no. of instruction to have N amoebas

https://www.generacodice.com/jp/articolo/1808747/you-have-k-amoebas-and-one-amoeba-can-divide-into-a-b-c-amoebas-after-one-instruction-then-find-the-minimum-no-of-instruction-to-have-n-amoebas
  dynamic-programming  -  greedy-algorithms
cs.stackexchange cs.stackexchange

Schedule each entree so that all entrees are completed in the shortest amount of time

https://www.generacodice.com/jp/articolo/1621814/schedule-each-entree-so-that-all-entrees-are-completed-in-the-shortest-amount-of-time
  greedy-algorithms
cs.stackexchange cs.stackexchange
結果が見つかりました: 289
scroll top