activity
20102022
most citedStrassen's Matrix Multiplication Algorithm for Matrices of Arbitrary Order

7 citations · 23 across the 11 of their papers we have counts for

collaborators

11 papers

math.OC2022★ 1 cited

Partitioned vs. Integrated Planning of Hinterland Networks for LCL Transportation

Niklas Jost, Dorothee Henke, Ivo Hedtke +4

Utilizing existing transportation networks better and designing (parts of) networks involves routing decisions to minimize transportation costs and maximize consolidation effects.…

math.OC2021

Spot Market versus Full Charter Fleet: Decisions Support for Full Truck Load Tenders

Veaceslav Ghilas, Ivo Hedtke, Joachim Weise +1

This paper presents an approach to help business decision-makers gain market share by providing competitive tender offers for Full-Truck-Load (FTL) services. In particular, we comp…

cs.DS2018★ 2 cited

Exact Algorithms for the Maximum Planar Subgraph Problem: New Models and Experiments

Markus Chimani, Ivo Hedtke, Tilo Wiedera

Given a graph , the NP-hard Maximum Planar Subgraph problem asks for a planar subgraph of with the maximum number of edges. The only known non-trivial exact algorithm utiliz…

math.GR2013★ 4 cited

A Fast Search Algorithm for <m,m,m> Triple Product Property Triples and an Application for 5x5 Matrix Multiplication

Sarah Hart, Ivo Hedtke, Matthias Müller-Hannemann +1

We present a new fast search algorithm for <m,m,m> Triple Product Property (TPP) triples as defined by Cohn and Umans in 2003. The new algorithm achieves a speed-up factor of 40 up…

math.GR2011

Upgrading Subgroup Triple Product Property Triples

Ivo Hedtke

In 2003 COHN and UMANS introduced a group-theoretic approach to fast matrix multiplication. This involves finding large subsets of a group satisfying the Triple Product Propert…

math.GR2011

A note on the Triple Product Property subgroup capacity of finite groups

Ivo Hedtke

In the context of group-theoretic fast matrix multiplication the TPP capacity is used to bound the exponent of matrix multiplication. We prove a new and sharper upper bound for…