Timeline for Existence of path under weight and value budgets
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2020 at 10:30 | history | edited | CommunityBot |
Commonmark migration
|
|
| May 28, 2019 at 16:25 | vote | accept | Deangelo Kingwell | ||
| May 28, 2019 at 13:45 | answer | added | Yuval Filmus | timeline score: 1 | |
| May 28, 2019 at 13:40 | history | edited | Yuval Filmus | CC BY-SA 4.0 |
deleted 1 character in body; edited tags; edited title
|
| May 28, 2019 at 11:53 | comment | added | Marcus Ritt | Make the graph more restricted. Try to do the reduction first for a single item, then for two. | |
| May 28, 2019 at 3:49 | comment | added | Deangelo Kingwell | I have tried to construct a complete graph, so that I can represent every combination of choices of integers, but since both constraints are at most, this graph will return a yes instance even if the partition instance is no | |
| May 28, 2019 at 1:59 | comment | added | Marcus Ritt | What did you try? Consider encoding the decision to put an item in one or another part by different choices of arcs in an st-path. | |
| May 28, 2019 at 1:20 | review | Close votes | |||
| Jun 11, 2019 at 3:02 | |||||
| May 27, 2019 at 23:40 | review | First posts | |||
| May 28, 2019 at 1:04 | |||||
| May 27, 2019 at 23:38 | history | asked | Deangelo Kingwell | CC BY-SA 4.0 |