-
Facility location with entrance fees
Speaker: Mengfan Ma (Ph.D. student in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) March 11, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: In mechanism design, the facility location game is an extensively studied problem. In the classical model, the cost of each agent is…
-
Minimum violation vertex maps and their applications to cut problems
Speaker: Chao Xu (Assistant Professor in University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) 21:20-22:20 (Time in Auckland) March 4, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: The minimum violation problem asks for a vertex map from a digraph to a pattern digraph that minimizes violation, the total weight…
-
Reachability and Büchi games
Speaker: Yu Cong (undergraduate student in University of Electronic Science and Technology of China) Time: 10:00-11:00 (Time in Beijing) 15:00-16:00 (Time in Auckland) January 7, 2022 (Friday) Venue: B1-518B, Research Building 4 Abstract: Reachability and Buchi games are 2-player games on directed finite graphs. In this presentation, I will briefly introduce these two games and…
-
Brief introduction on fair allocations of divisible and indivisible goods
Speaker: Haoyun Jiang and Siyuan Du (undergraduate student in University of Electronic Science and Technology of China) Time: 10:00-11:00 (Time in Beijing) 15:00-16:00 (Time in Auckland) December 17, 2021 (Friday) Venue: B1-518B, Research Building 4 Abstract: The problem of fair allocations of goods can be divided into two sub-problems, goods are divisible and goods are…
-
The security issues in diffusion Auction
Speaker: Yuchao Song (master student in University of Electronic Science and Technology of China) Time: 10:00-11:00 (Time in Beijing) 15:00-16:00 (Time in Auckland) November 26, 2021 (Friday) Venue: B1-518B, Research Building 4 Abstract: With a rapid growth of social networks, promoting products through social networks has become a challenging and important problem for stakeholders. During…
-
Algorithms for general SAT
Speaker: Jian Ma(University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 15:00-17:00 (Time in Auckland) November 5, 2021 (Friday) Venue: Qingshuihe Campus Abstract: The CNF satisfiability problem is defined as follows: given a CNF formula , decide if there exists truth-value assignment to variables such that the formula evaluates to true.…
-
Quasi-Isometric Graph-Simplifications
Speaker: Roger Su(University of Auckland) Time: 10:00-12:00 (Time in Beijing) 15:00-17:00 (Time in Auckland) October 29, 2021 (Friday) Venue: Qingshuihe Campus Abstract: Quasi-isometries are a concept originally used to study infinite algebraic objects. Here we apply quasi-isometries to finite graphs, and propose a theoretical framework for simplifying large-scale graphs. This framework consists of several goals,…
-
Subset Feedback Vertex Set in Chordal Graph
Speaker: Tian Bai(University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 14:00-16:00 (Time in Auckland) October 15, 2021 (Friday) Venue: Qingshuihe Campus Abstract: The Subset Feedback Vertex Set (SFVS) problem takes as input a graph and a subset of vertices in . The task is to find a minimal set of…
-
Approximation Algorithms for TTP-3
Speaker: Jingyang Zhao(University of Electronic and Science Technology of China) Time: 10:00-12:00 (Time in Beijing) 14:00-16:00 (Time in Auckland) September 10, 2021 (Friday) VooVmeeting: Link: https://meeting.tencent.com/dm/xKZlIrcZhk0Z ID: 704 420 285 Venue: Qingshuihe Campus Abstract: The Traveling Tournament Problem is a complex combinatorial optimization problem in tournament timetabling, which asks us to design a double round-robin…
-
Heuristic Algorithms for Steiner Tree Problem
Speaker: Xinyu Wu (University of Electronic and Science Technology of China) Time: 10:00-11:00 (Time in Beijing) 14:00-15:00 (Time in Auckland) September 3, 2021 (Friday) VooVmeeting: Link: https://meeting.tencent.com/dm/WlulUnrGJ0NM?rs=25 ID: 969 615 091 Venue: Qingshuihe Campus Abstract: The Steiner tree problem (STP) is a challenging NP-hard problem that commonly arises in practical applications as one of many…