2
votes
Accepted
Dual of cut of embedded graph disconnects surface
I assume that you require that all faces of $G$ are topological disks. After cutting along $C^*$, each face is a topological disk bounded by either a cycle of $G$, or a cycle that consists of two arcs ...
- 597
1
vote
Bin packing with non-additive load functions
In addition to the papers you cited, there are two others I'm aware of:
Bin packing with general cost structures
Bin packing problem with concave costs of bin utilization
- 11
Only top scored, non community-wiki answers of a minimum length are eligible