Nili Guttmann-Beck - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2023

Achieving feasibility for clustered traveling salesman problems using PQ-treesNili Guttmann-Beck, Hadas Meshita-Sayag, Michal Stern. networks, 82(2):153-166, September 2023. [doi]

2022

Two dimensional maximum weight matching using Manhattan topologyNili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern. orl, 50(3):281-286, 2022. [doi]

Erratum to "Two dimensional maximum weight matching using Manhattan topology" [Oper. Res. Lett. 50 (3) (2022) 281-286]Nili Guttmann-Beck, Hila Ohana Brumer, Yulia Shalev, Eitan Shvartz, Michal Stern. orl, 50(5):475, 2022. [doi]

2021

Vertices removal for feasibility of clustered spanning treesNili Guttmann-Beck, Roni Rozen, Michal Stern. DAM, 296:68-84, 2021. [doi]

2019

FOM - a MATLAB toolbox of first-order methods for solving convex optimization problemsAmir Beck, Nili Guttmann-Beck. oms, 34(1):172-193, 2019. [doi]

Clustered Spanning Tree - Conditions for FeasibilityNili Guttmann-Beck, Zeev Sorek, Michal Stern. dmtcs, 21(1), 2019. [doi]

2018

Approximation Algorithms for Not Necessarily Disjoint Clustered TSPNili Guttmann-Beck, Eyal Knaan, Michal Stern. jgaa, 22(4):555-575, 2018. [doi]

2012

The (K, k)-capacitated spanning tree problemEsther M. Arkin, Nili Guttmann-Beck, Refael Hassin. disopt, 9(4):258-266, 2012. [doi]

Series-parallel orientations preserving the cycle-radiusNili Guttmann-Beck, Refael Hassin. ipl, 112(4):153-160, 2012. [doi]

2011

On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graphNili Guttmann-Beck, Refael Hassin. disopt, 8(2):302-314, 2011. [doi]

2010

The (::::K::::, ::::k::::)-Capacitated Spanning Tree ProblemEsther M. Arkin, Nili Guttmann-Beck, Refael Hassin. AAIM 2010: 25-34 [doi]

The CoMirror algorithm for solving nonsmooth constrained convex problemsAmir Beck, Aharon Ben-Tal, Nili Guttmann-Beck, Luba Tetruashvili. orl, 38(6):493-498, 2010. [doi]

On two restricted ancestors tree problemsNili Guttmann-Beck, Refael Hassin. ipl, 110(14-15):570-575, 2010. [doi]

2000

Approximation Algorithms for Minimum ::::K::::-CutNili Guttmann-Beck, Refael Hassin. algorithmica, 27(2):198-207, 2000. [doi]

Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman ProblemNili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari. algorithmica, 28(4):422-437, 2000. [doi]

1998

Approximation Algorithms for Min-sum p-clusteringNili Guttmann-Beck, Refael Hassin. DAM, 89(1-3):125-142, 1998. [doi]

Approximation Algorithms for Minimum Tree PartitionNili Guttmann-Beck, Refael Hassin. DAM, 87(1-3):117-137, 1998. [doi]

Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman ProblemNili Guttmann-Beck, Refael Hassin, Samir Khuller, Balaji Raghavachari. fsttcs 1998: 6-17

1997

Approximation Algorithms for Min-Max Tree PartitionNili Guttmann-Beck, Refael Hassin. jal, 24(2):266-286, 1997.

Sign in or sign up to see more results.

runs on WebDSL