IEEE

NK-MaxClique and MMCQ: Tow New Exact Branch and Bound Algorithms for the Maximum Clique Problem

Abstract: The maximum clique problem (MCP) is a fundamental problem in combinatorial optimization which finds important applications in real-word. This paper describes two new efficient ...
GitHub

minorminer is a heuristic tool for minor embedding: given a minor and target graph, it tries to find a mapping that embeds the minor into the target.

The primary utility function, find_embedding(), is an implementation of the heuristic algorithm described in [1]. It accepts various optional parameters used to tune the algorithm's execution or ...
The Conversation

AI that mimics human problem solving is a big advance – but comes with new risks and problems

OpenAI recently unveiled its latest artificial intelligence (AI) models, o1-preview and o1-mini (also referred to as “Strawberry”), claiming a significant leap in the reasoning capabilities of large ...
IEEE

An O(1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique

Abstract: We study the Traveling Salesman Problem (TSP) in the Congested Clique Model (CCM) of distributed computing. We present a deterministic distributed algorithm that computes a tour for the TSP ...
Frontiers

PyRAT: An Open-Source Python Library for Animal Behavior Analysis

Here we developed an open-source Python-based library called Python rodent Analysis and Tracking (PyRAT). Our library analyzes tracking data to classify distinct behaviors, estimate traveled distance, ...