Nili Guttmann-Beck

Available identifiers

zbMath Open guttmann-beck.niliMaRDI QIDQ413266

List of research outcomes

Publication	Date of Publication	Type
On partitioning minimum spanning trees	2024-11-06	Paper
Decomposing the feasibility of clustered spanning tree by paths	2024-06-20	Paper
Achieving feasibility for clustered traveling salesman problems using PQ‐trees	2023-12-18	Paper
Erratum to: ``Two dimensional maximum weight matching using Manhattan topology	2022-10-17	Paper
Two dimensional maximum weight matching using Manhattan topology	2022-07-22	Paper
Vertices removal for feasibility of clustered spanning trees	2021-04-20	Paper
https://portal.mardi4nfdi.de/entity/Q5207831	2020-01-13	Paper
FOM – a MATLAB toolbox of first-order methods for solving convex optimization problems	2019-01-14	Paper
Approximation Algorithms for Not Necessarily Disjoint Clustered TSP	2018-11-12	Paper
The \((K, k)\)-capacitated spanning tree problem	2012-12-28	Paper
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph	2012-06-20	Paper
Series-parallel orientations preserving the cycle-radius	2012-05-04	Paper
On two restricted ancestors tree problems	2012-03-19	Paper
The CoMirror algorithm for solving nonsmooth constrained convex problems	2010-12-23	Paper
The (K,k)-Capacitated Spanning Tree Problem	2010-07-20	Paper
Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem	2000-11-14	Paper
https://portal.mardi4nfdi.de/entity/Q4247262	2000-01-18	Paper
Approximation algorithms for minimum \(K\)-cut	2000-01-01	Paper
Approximation algorithms for min-sum \(p\)-clustering	1999-03-22	Paper
Approximation algorithms for minimum tree partition	1999-01-25	Paper
Approximation Algorithms for Min–Max Tree Partition	1997-12-16	Paper

Research outcomes over time

This page was built for person: Nili Guttmann-Beck