UVa 11747 - Heavy Cycle Edges

  1  /*
  2  Problem type: Graph - MST
  3  Algorithm: Find the Minimum Spanning Tree (MST) (using Kruskal,
  4      Prim) and print out all the edges which are not included in the MST.
  5  */

UVa 10020 - Minimal coverage

  1 /*
  2  Problem link
  3  Type: Greedy - INTERVAL COVERING
  4  Algorithm:

uva 410 - Station Balance

  1 /*
  2  Problem link
  3  Type: Recursion - Greedy
  4  Algorithm:

uva 311 - Packets

  1  /*
  2  Problem link
  3  Type: Ad hoc, Greedy
  4  Algorithm: