Cover Image

Empirical Analysis Of Heuristic and Approximation Algorithms for the The Mutual-Visibility Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Stojanović, Vanja, Pangeršič, Bor
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry Artificial Intelligence Performance Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Mutual-Visibility Problem In Directed Graphs
by: Stojanović, Vanja
Published: (2026)

The Zarankiewicz Problem for Polygon Visibility Graphs
by: Ackerman, Eyal, et al.
Published: (2025)

Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems
by: Rosin, Christopher D.
Published: (2025)

Towards Safer Heuristics With XPlain
by: Karimi, Pantea, et al.
Published: (2024)

HRA: A Multi-Criteria Framework for Ranking Metaheuristic Optimization Algorithms
by: Goula, Evgenia-Maria K., et al.
Published: (2024)

BEAM: Bi-level Memory-adaptive Algorithmic Evolution for LLM-Powered Heuristic Design
by: Xiang, Chuyang, et al.
Published: (2026)

Empirical Evaluation of Integrated Trust Mechanism to Improve Trust in E-commerce Services
by: Yasir, Siddiqui Muhammad, et al.
Published: (2024)

Impact of Data-Oriented and Object-Oriented Design on Performance and Cache Utilization with Artificial Intelligence Algorithms in Multi-Threaded CPUs
by: Arantes, Gabriel M., et al.
Published: (2025)

Gold-Medal-Level Olympiad Geometry Solving with Efficient Heuristic Auxiliary Constructions
by: Duan, Boyan, et al.
Published: (2025)

Algorithms for orthogonal partitioning into four parts
by: Fakhrutdinov, Alexey, et al.
Published: (2025)

On the Compression of Language Models for Code: An Empirical Study on CodeBERT
by: d'Aloisio, Giordano, et al.
Published: (2024)

gDist: Efficient Distance Computation between 3D Meshes on GPU
by: Fang, Peng, et al.
Published: (2024)

Randomized HyperSteiner: A Stochastic Delaunay Triangulation Heuristic for the Hyperbolic Steiner Minimal Tree
by: Medbouhi, Aniss Aiman, et al.
Published: (2025)

Subset Selection Problems in Planar Point Sets
by: Balogh, József, et al.
Published: (2024)

Approximation Depth of Convex Polytopes
by: Bakaev, Egor, et al.
Published: (2025)

Harnessing Chain-of-Thought Metadata for Task Routing and Adversarial Prompt Detection
by: Marinelli, Ryan, et al.
Published: (2025)

DeepSeek-R1 Outperforms Gemini 2.0 Pro, OpenAI o1, and o3-mini in Bilingual Complex Ophthalmology Reasoning
by: Xu, Pusheng, et al.
Published: (2025)

TeleEval-OS: Performance evaluations of large language models for operations scheduling
by: Wang, Yanyan, et al.
Published: (2025)

Hold Onto That Thought: Assessing KV Cache Compression On Reasoning
by: Liu, Minghui, et al.
Published: (2025)

A Data-driven ML Approach for Maximizing Performance in LLM-Adapter Serving
by: Agullo, Ferran, et al.
Published: (2025)

Embedding Retrofitting: Data Engineering for better RAG
by: Sharma, Anantha
Published: (2026)

DyLLM: Efficient Diffusion LLM Inference via Saliency-based Token Selection and Partial Attention
by: Lee, Younjoo, et al.
Published: (2026)

Performance Characterization of Expert Router for Scalable LLM Inference
by: Pichlmeier, Josef, et al.
Published: (2024)

Energy Concerns with HPC Systems and Applications
by: Nana, Roblex, et al.
Published: (2023)

DeepContext: A Context-aware, Cross-platform, and Cross-framework Tool for Performance Profiling and Analysis of Deep Learning Workloads
by: Zhao, Qidong, et al.
Published: (2024)

The Mutual Visibility Problem for Fat Robots with Lights
by: Alsaedi, Rusul J., et al.
Published: (2022)

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
by: Galby, Esther, et al.
Published: (2023)

SLiM: One-shot Quantization and Sparsity with Low-rank Approximation for LLM Weight Compression
by: Mozaffari, Mohammad, et al.
Published: (2024)

Mathematical exploration and discovery at scale
by: Georgiev, Bogdan, et al.
Published: (2025)

Do AI Models Dream of Faster Code? An Empirical Study on LLM-Proposed Performance Improvements in Real-World Software
by: Yi, Lirong, et al.
Published: (2025)

Gromov's Approximating Tree and the All-Pairs Bottleneck Paths Problem
by: Cornect, Anders, et al.
Published: (2024)

Low-Rank GEMM: Efficient Matrix Multiplication via Low-Rank Approximation with FP8 Acceleration
by: Metere, Alfredo
Published: (2025)

A Comparative Study of OpenMP Scheduling Algorithm Selection Strategies
by: Korndörfer, Jonas H. Müller, et al.
Published: (2025)

Performance Evaluation of Bitstring Representations in a Linear Genetic Programming Framework
by: Meli, Clyde, et al.
Published: (2025)

Time-Efficient Hybrid Hyperparameter Tuning Approach for Cardiovascular Disease Classification
by: Pathak, Abhay Kumar, et al.
Published: (2024)

A 4D Hybrid Algorithm to Scale Parallel Training to Thousands of GPUs
by: Singh, Siddharth, et al.
Published: (2023)

Ollivier-Ricci Curvature of Riemannian Manifolds and Directed Graphs with Applications to Graph Neural Networks
by: Wiesler, Eleanor
Published: (2026)

ShadowNPU: System and Algorithm Co-design for NPU-Centric On-Device LLM Inference
by: Yin, Wangsong, et al.
Published: (2025)

FastCache: Fast Caching for Diffusion Transformer Through Learnable Linear Approximation
by: Liu, Dong, et al.
Published: (2025)

Witness Set in Monotone Polygons: Exact and Approximate
by: Das, Udvas, et al.
Published: (2025)