benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU-Pro / 10386 / Which of the following problems can be solved by a standard greedy algorithm?

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

Which of the following problems can be solved by a standard greedy algorithm?
I. Finding a minimum spanning tree in an undirected graph with positive-integer edge weights
II. Finding a maximum clique in an undirected graph
III. Finding a maximum flow from a source node to a sink node in a directed graph with positive-integer edge capacities

category

computer science

options

  1. None of the above
  2. III only
  3. I, II and III
  4. III, and II, but not always I
  5. I, and II, but not always III
  6. I and II only
  7. II only
  8. II and III only
  9. I only
  10. I and III only

src

ori_mmlu-college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

upstream_id / Original problem ID
10386
task_id
687aa045-5e94-5354-9a9d-47778cf41f04
task_key
default--test--10386
task_revision_id
1
config / split
default / test

Official source

initial import