• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.253-259
• /
• 2019

The wedding seating problem(WSP) is to finding a minimum loss of guest relations(sit together preference) with restricted seats of a table for complex guest relation network. The WSP is NP-hard because of the algorithm that can be find the optimal solution within polynomial-time is unknown yet. Therefore we can't solve the WSP not computer-assisted programming but by hand. This paper suggests min-cut rule theory that the two guests with maximum preference can't separate in other two tables because this is not obtains minimum loss of preference. As a result of various experimental, this algorithm obtains proper seating chart meet to the seats of a table constraints.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.197-200
• /
• 2010

The development of service industries like more information on each individual's comments are provided only for wanting to receive services that do not like the prolonged waiting time. However, existing venues, theaters, libraries and seating management systems to suit the individual seating arrangements can not automatically provide information and give everyone the same. In this paper these issues to improve the fit of personal preference or personal inclination of the body in condition to meet intelligently deployed seats, and can provide information only preferred system is proposed. To verify the proposed system's performance using any of the theater seating chart for the experiments was to check to see better performance could be seen.