Skip to content

Fix #47: Add HamiltonianCycle model #57

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
GiggleLiu merged 4 commits into from
Feb 13, 2026
Merged

Fix #47: Add HamiltonianCycle model #57

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
7010cdc
Add plan for #47: [Model] HamiltonianCycle
GiggleLiu Feb 13, 2026
fd87dc6
feat: add HamiltonianCycle model (#47)
GiggleLiu Feb 13, 2026
510987c
docs: add HamiltonianCycle definition to paper (#47)
GiggleLiu Feb 13, 2026
53c68d0
refactor: rename HamiltonianCycle to TravelingSalesman (#47)
GiggleLiu Feb 13, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 5 additions & 0 deletions docs/paper/reductions.typ
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -31,6 +31,7 @@
"KColoring": [$k$-Coloring],
"MinimumDominatingSet": [Minimum Dominating Set],
"MaximumMatching": [Maximum Matching],
"TravelingSalesman": [Traveling Salesman],
"MaximumClique": [Maximum Clique],
"MaximumSetPacking": [Maximum Set Packing],
"MinimumSetCovering": [Minimum Set Covering],
Expand Down Expand Up @@ -324,6 +325,10 @@ In all graph problems below, $G = (V, E)$ denotes an undirected graph with $|V|
Given $G = (V, E)$ with weights $w: E -> RR$, find $M subset.eq E$ maximizing $sum_(e in M) w(e)$ s.t. $forall e_1, e_2 in M: e_1 inter e_2 = emptyset$.
]

#problem-def("TravelingSalesman")[
Given an undirected graph $G=(V,E)$ with edge weights $w: E -> RR$, find an edge set $C subset.eq E$ that forms a cycle visiting every vertex exactly once and minimizes $sum_(e in C) w(e)$.
]

#problem-def("MaximumClique")[
Given $G = (V, E)$, find $K subset.eq V$ maximizing $|K|$ such that all pairs in $K$ are adjacent: $forall u, v in K: (u, v) in E$. Equivalent to MIS on the complement graph $overline(G)$.
]
Expand Down
Loading