Exact Algorithms for Uniquifying Minimum Vertex Covers under Pre-assignment Models

• Item type: SIG Technical Reports(1)
• 公開日: 2024-05-01
• タイトル: Exact Algorithms for Uniquifying Minimum Vertex Covers under Pre-assignment Models
• タイトル / 言語: en
• タイトル: Exact Algorithms for Uniquifying Minimum Vertex Covers under Pre-assignment Models
• 言語: eng
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_18gh
• 資源タイプ: technical report
• 著者所属: Hokkaido University
• 著者所属: Hokkaido University
• 著者所属: Nagoya University
• 著者所属: Hokkaido University
• 著者所属: Hokkaido University
• 著者所属(英): en
• 著者所属(英): Hokkaido University
• 著者所属(英): en
• 著者所属(英): Hokkaido University
• 著者所属(英): en
• 著者所属(英): Nagoya University
• 著者所属(英): en
• 著者所属(英): Hokkaido University
• 著者所属(英): en
• 著者所属(英): Hokkaido University
• 著者名: Takashi, Horiyama; Yasuaki, Kobayashi; Hirotaka, Ono; Kazuhisa, Seto; Ryu, Suzuki
• 著者名(英): Takashi, Horiyama; Yasuaki, Kobayashi; Hirotaka, Ono; Kazuhisa, Seto; Ryu, Suzuki
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Given an instance of combinatorial optimization problem A with multiple optimal solutions, how can we efficiently reduce it into an instance of A with a unique optimal solution? In AAAI 2024, we formulated the problem of uniquifying minimum vertex covers under pre-assignments: how many vertices are included/excluded vertices into/from vertex covers to uniquify minimum vertex covers including/excluding these vertices? We showed the Σ???? 2 -completeness for general graphs and the NP-completeness for bipartite graphs. We designed an ????(2.1996????)-time algorithm for general graphs and an ????(1.9181????)-time algorithm for bipartite graphs, where ???? is the number of vertices. The latter is based on an FPT algorithm with ????∗ (3.6791????) time for vertex cover number ????. In this report, we present these algorithms.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Given an instance of combinatorial optimization problem A with multiple optimal solutions, how can we efficiently reduce it into an instance of A with a unique optimal solution? In AAAI 2024, we formulated the problem of uniquifying minimum vertex covers under pre-assignments: how many vertices are included/excluded vertices into/from vertex covers to uniquify minimum vertex covers including/excluding these vertices? We showed the Σ???? 2 -completeness for general graphs and the NP-completeness for bipartite graphs. We designed an ????(2.1996????)-time algorithm for general graphs and an ????(1.9181????)-time algorithm for bipartite graphs, where ???? is the number of vertices. The latter is based on an FPT algorithm with ????∗ (3.6791????) time for vertex cover number ????. In this report, we present these algorithms.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN1009593X
• 書誌情報: 研究報告アルゴリズム（AL）; 巻 2024-AL-198, 号 9, p. 1-4, 発行日 2024-05-01
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 2188-8566
• Notice: SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc.
• 出版者 / 言語: ja
• 出版者: 情報処理学会