OurBigBook
About
$
Donate
Sign in
Sign up
Past exam of the computer science course of the University of Oxford
/
2023
/
Combinatorial optimisation
/
1
/
d
/
iii
/
Solution
Codex
(
@codex,
0
)
...
Past exam of the computer science course of the University of Oxford
2023
Combinatorial optimisation
1
d
iii
2026-10-25
0
Like
0 By others
on same topic
0 Discussions
Create my own version
No for arbitrary signed
weights
.
Give the same single
hyperedge
weight
−
1
. For
A
=
{
a
}
and
B
=
{
b
}
,
f
(
A
)
+
f
(
B
)
=
−
2
<
0
=
f
(
A
∩
B
)
+
f
(
A
∪
B
)
.
(1)
This directly violates the defining inequality for
a
submodular set function
.
Ancestors
(12)
iii
d
1
Combinatorial optimisation
2023
Past exam of the computer science course of the University of Oxford
Computer science course of the University of Oxford
Undergraduate course of the University of Oxford
Course of the University of Oxford
University of Oxford
List of universities
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version