ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2312.10887
  4. Cited By
On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile
  Puzzles

On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzles

18 December 2023
Marcus Gozon
Jingjin Yu
ArXivPDFHTML

Papers citing "On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzles"

2 / 2 papers shown
Title
Optimally Solving Colored Generalized Sliding-Tile Puzzles: Complexity
  and Bounds
Optimally Solving Colored Generalized Sliding-Tile Puzzles: Complexity and Bounds
Marcus Gozon
Jingjin Yu
30
0
0
19 Oct 2024
Sub-1.5 Time-Optimal Multi-Robot Path Planning on Grids in Polynomial
  Time
Sub-1.5 Time-Optimal Multi-Robot Path Planning on Grids in Polynomial Time
Teng Guo
Jingjin Yu
47
16
0
22 Jan 2022
1