Wyniki wyszukiwania dla: greedy algorithm

• Graphs hard-to-process for greedy algorithm MIN

  Publikacja

  • M. Jurkiewicz
  • K. Pastuszak
  • M. Szypulski

  - Rok 2021

  We compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.

  Pełny tekst do pobrania w serwisie zewnętrznym

• An Approximation of the Zero Error Capacity by a Greedy Algorithm

  Publikacja

  • M. Jurkiewicz

  - Rok 2020

  We present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.

• An Approximation of the Zero Error Capacity by a Greedy Algorithm.

  Publikacja

  • M. Jurkiewicz

  - Rok 2020

  We present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.

  Pełny tekst do pobrania w serwisie zewnętrznym

• On zero-error codes produced by greedy algorithms

  Publikacja

  • M. Jurkiewicz

  - JOURNAL OF COMBINATORIAL OPTIMIZATION - Rok 2022

  We present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.

  Pełny tekst do pobrania w portalu

• Greedy algorithms for backbone graph coloring in KOALA library

  Publikacja

  • K. Turowski

  - Rok 2012

• Algorithms

  Czasopisma

  ISSN: 1999-4893

• GREEN CHEMISTRY

  Czasopisma

  ISSN: 1463-9262 , eISSN: 1463-9270

• From grey to green

  Publikacja

  • K. Rembarz
  • H. Shin
  • M. Koshy
  • E. Knyzelite
  • O. O’connor

  - Rok 2016

  The article presents conceptual project made by students during Urban European Summer School “City on water” in Bremen 2015. The area of study was Hemelingen, Aller-Harbour, Bremen, Germany. The aim was to make a design of regeneration of the area. Students were free in choosing methods and ideas for their project.

• NUMERICAL ALGORITHMS

  Czasopisma

  ISSN: 1017-1398 , eISSN: 1572-9265

• Greedy T-colorings of graphs

  Publikacja

  • R. Janczewski

  - DISCRETE MATHEMATICS - Rok 2009

  Treścią artykułu są pokolorowania kontrastowe wygenerowane przez algorytm zachłanny. Zbadane zostały ich własności, obejmujące liczbę kolororów, rozpiętość i rozpiętość krawędziową.

  Pełny tekst do pobrania w portalu