default search action
Hadas Shachnai
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j70]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
The preemptive resource allocation problem. J. Sched. 27(1): 103-118 (2024) - [c78]Aviram Imber, Jonas Israel, Markus Brill, Hadas Shachnai, Benny Kimelfeld:
Spatial Voting with Incomplete Voter Information. AAAI 2024: 9790-9797 - [c77]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. APPROX/RANDOM 2024: 27:1-27:17 - [c76]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Lower Bounds for Matroid Optimization Problems with a Linear Constraint. ICALP 2024: 56:1-56:20 - [i31]Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Approximations and Hardness of Packing Partially Ordered Items. CoRR abs/2403.01568 (2024) - 2023
- [j69]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An FPTAS for budgeted laminar matroid independent set. Oper. Res. Lett. 51(6): 632-637 (2023) - [c75]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An AFPTAS for Bin Packing with Partition Matroid via a New Method for LP Rounding. APPROX/RANDOM 2023: 22:1-22:16 - [c74]Ariel Kulik, Matthias Mnich, Hadas Shachnai:
Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding. FOCS 2023: 1366-1376 - [c73]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets. ICALP 2023: 49:1-49:16 - [c72]Tomer Cohen, Ariel Kulik, Hadas Shachnai:
Improved Approximation for Two-Dimensional Vector Multiple Knapsack. ISAAC 2023: 20:1-20:17 - [c71]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Budgeted Matroid Maximization: a Parameterized Viewpoint. IPEC 2023: 13:1-13:17 - [c70]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matroid Independent Set. SOSA 2023: 69-83 - [c69]Ilan Doron-Arad, Hadas Shachnai:
Approximating Bin Packing with Conflict Graphs via Maximization Techniques. WG 2023: 261-275 - [i30]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection. CoRR abs/2302.05681 (2023) - [i29]Aviram Imber, Jonas Israel, Markus Brill, Hadas Shachnai, Benny Kimelfeld:
Finding Possible and Necessary Winners in Spatial Voting with Partial Information. CoRR abs/2302.08929 (2023) - [i28]Ilan Doron-Arad, Hadas Shachnai:
Approximating Bin Packing with Conflict Graphs via Maximization Techniques. CoRR abs/2302.10613 (2023) - [i27]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An FPTAS for Budgeted Laminar Matroid Independent Set. CoRR abs/2304.13984 (2023) - [i26]Tomer Cohen, Ariel Kulik, Hadas Shachnai:
Improved Approximation for Two-dimensional Vector Multiple Knapsack. CoRR abs/2307.02137 (2023) - [i25]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Budgeted Matroid Maximization: a Parameterized Viewpoint. CoRR abs/2307.04173 (2023) - [i24]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Tight Lower Bounds for Weighted Matroid Problems. CoRR abs/2307.07773 (2023) - [i23]Ilan Doron-Arad, Hadas Shachnai:
Tight Bounds for Budgeted Maximum Weight Independent Set in Bipartite and Perfect Graphs. CoRR abs/2307.08592 (2023) - [i22]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding. CoRR abs/2308.12622 (2023) - 2022
- [j68]Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai:
An almost optimal approximation algorithm for monotone submodular multiple knapsack. J. Comput. Syst. Sci. 125: 149-165 (2022) - [i21]Ariel Kulik, Matthias Mnich, Hadas Shachnai:
An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem. CoRR abs/2205.12828 (2022) - [i20]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An EPTAS for Budgeted Matroid Independent Set. CoRR abs/2209.04654 (2022) - [i19]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins. CoRR abs/2212.01025 (2022) - 2021
- [j67]Ariel Kulik, Hadas Shachnai, Gal Tamir:
On Lagrangian relaxation for constrained maximization and reoptimization problems. Discret. Appl. Math. 296: 164-178 (2021) - [j66]Ariel Kulik, Roy Schwartz, Hadas Shachnai:
A refined analysis of submodular Greedy. Oper. Res. Lett. 49(4): 507-514 (2021) - [c68]Yaron Fairstein, Ariel Kulik, Hadas Shachnai:
Modular and Submodular Optimization with Multiple Knapsack Constraints via Fractional Grouping. ESA 2021: 41:1-41:16 - [c67]Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An APTAS for Bin Packing with Clique-Graph Conflicts. WADS 2021: 286-299 - [i18]Ariel Kulik, Roy Schwartz, Hadas Shachnai:
A Faster Tight Approximation for Submodular Maximization Subject to a Knapsack Constraint. CoRR abs/2102.12879 (2021) - 2020
- [j65]Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai:
The Euclidean k-Supplier Problem. Math. Oper. Res. 45(1): 1-14 (2020) - [c66]Lior Ben Yamin, Jing Li, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Maximizing Throughput in Flow Shop Real-Time Scheduling. APPROX-RANDOM 2020: 48:1-48:18 - [c65]Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai:
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. ESA 2020: 44:1-44:19 - [c64]Ariel Kulik, Hadas Shachnai:
Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. FOCS 2020: 762-773 - [i17]Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz, Hadas Shachnai:
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. CoRR abs/2004.12224 (2020) - [i16]Yaron Fairstein, Ariel Kulik, Hadas Shachnai:
tight approximations for modular and submodular optimization with d-resource multiple knapsack constraints. CoRR abs/2007.10470 (2020) - [i15]Ilan Doron-Arad, Hadas Shachnai:
An APTAS for Bin Packing with Clique-graph Conflicts. CoRR abs/2011.04273 (2020)
2010 – 2019
- 2019
- [j64]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi:
Improved Parameterized Algorithms for Network Query Problems. Algorithmica 81(6): 2270-2316 (2019) - [j63]Dmitriy Katz, Baruch Schieber, Hadas Shachnai:
Flexible Resource Allocation to Interval Jobs. Algorithmica 81(8): 3217-3244 (2019) - [j62]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Constrained submodular maximization via greedy local search. Oper. Res. Lett. 47(1): 1-6 (2019) - [c63]Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment via Submodular Optimization with Reserved Capacity. ESA 2019: 69:1-69:15 - [c62]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
The Preemptive Resource Allocation Problem. FSTTCS 2019: 26:1-26:15 - [i14]Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment via Submodular Optimization with Reserved Capacity. CoRR abs/1907.01745 (2019) - [i13]Ariel Kulik, Hadas Shachnai:
Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations. CoRR abs/1911.02653 (2019) - 2018
- [j61]Baruch Schieber, Hadas Shachnai, Gal Tamir, Tami Tamir:
A Theory and Algorithms for Combinatorial Reoptimization. Algorithmica 80(2): 576-607 (2018) - [j60]Sonia Toubaline, Claudia D'Ambrosio, Leo Liberti, Pierre-Louis Poirion, Baruch Schieber, Hadas Shachnai:
Complexity and inapproximability results for the Power Edge Set problem. J. Comb. Optim. 35(3): 895-905 (2018) - [j59]Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai:
Parameterized approximation via fidelity preserving transformations. J. Comput. Syst. Sci. 93: 30-40 (2018) - [j58]Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
Flexible bandwidth assignment with application to optical networks. J. Sched. 21(3): 327-336 (2018) - [c61]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment of Time-Sensitive Item Groups. APPROX-RANDOM 2018: 24:1-24:18 - [c60]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation. SPAA 2018: 343-345 - [p1]Hadas Shachnai, Tami Tamir:
Polynomial Time Approximation Schemes. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 125-156 - [i12]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
The Preemptive Resource Allocation Problem. CoRR abs/1811.07413 (2018) - 2017
- [j57]Hadas Shachnai, Meirav Zehavi:
A multivariate framework for weighted FPT algorithms. J. Comput. Syst. Sci. 89: 157-189 (2017) - [j56]Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
Optimizing bandwidth allocation in elastic optical networks with application to scheduling. J. Discrete Algorithms 45: 1-13 (2017) - [j55]Hadas Shachnai, Meirav Zehavi:
Parameterized Algorithms for Graph Partitioning Problems. Theory Comput. Syst. 61(3): 721-738 (2017) - [c59]Keren Censor-Hillel, Rina Levy, Hadas Shachnai:
Fast Distributed Approximation for Max-Cut. ALGOSENSORS 2017: 41-56 - [i11]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Constrained Submodular Maximization via Greedy Local Search. CoRR abs/1705.06319 (2017) - [i10]Keren Censor-Hillel, Rina Levy, Hadas Shachnai:
Fast Distributed Approximation for Max-Cut. CoRR abs/1707.08496 (2017) - 2016
- [j54]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi:
Deterministic parameterized algorithms for the Graph Motif problem. Discret. Appl. Math. 213: 162-178 (2016) - [j53]Hadas Shachnai, Meirav Zehavi:
Representative families: A unified tradeoff-based approach. J. Comput. Syst. Sci. 82(3): 488-502 (2016) - [j52]Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir:
All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. ACM Trans. Algorithms 12(3): 38:1-38:25 (2016) - [j51]Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks:
Constructing minimum changeover cost arborescenses in bounded treewidth graphs. Theor. Comput. Sci. 621: 22-36 (2016) - [j50]Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai:
Tractable Parameterizations for the Minimum Linear Arrangement Problem. ACM Trans. Comput. Theory 8(2): 6:1-6:12 (2016) - [c58]Sivan Albagli-Kim, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Real-Time k-bounded Preemptive Scheduling. ALENEX 2016: 127-137 - [c57]Dmitriy Katz, Baruch Schieber, Hadas Shachnai:
Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks. SPAA 2016: 225-226 - [i9]Dmitriy Katz, Baruch Schieber, Hadas Shachnai:
Flexible Resource Allocation for Clouds and All-Optical Networks. CoRR abs/1605.04982 (2016) - 2015
- [j49]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi:
Partial Information Network Queries. J. Discrete Algorithms 31: 129-145 (2015) - [j48]Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Real-time scheduling to minimize machine busy times. J. Sched. 18(6): 561-573 (2015) - [c56]Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, Joel L. Wolf:
The Container Selection Problem. APPROX-RANDOM 2015: 416-434 - [c55]Hadas Shachnai, Meirav Zehavi:
A Multivariate Approach for Weighted FPT Algorithms. ESA 2015: 965-976 - [i8]Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks:
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. CTW 2015: 201-204 - [i7]Ariel Kulik, Hadas Shachnai, Gal Tamir:
On Lagrangian Relaxation and Reoptimization Problems. CoRR abs/1512.06736 (2015) - 2014
- [j47]Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir:
Packing resizable items with application to video delivery over wireless networks. Theor. Comput. Sci. 553: 91-105 (2014) - [c54]Hadas Shachnai, Meirav Zehavi:
Representative Families: A Unified Tradeoff-Based Approach. ESA 2014: 786-797 - [c53]Sivan Albagli-Kim, Hadas Shachnai, Tami Tamir:
Scheduling jobs with dwindling resource requirements in clouds. INFOCOM 2014: 601-609 - [c52]Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
Optimizing Bandwidth Allocation in Flex-Grid Optical Networks with Application to Scheduling. IPDPS 2014: 862-871 - [c51]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi:
Improved Parameterized Algorithms for Network Query Problems. IPEC 2014: 294-306 - [c50]Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi:
Deterministic Parameterized Algorithms for the Graph Motif Problem. MFCS (2) 2014: 589-600 - [c49]Hadas Shachnai, Ariella Voloshin, Shmuel Zaks:
Flexible Bandwidth Assignment with Application to Optical Networks - (Extended Abstract). MFCS (2) 2014: 613-624 - [c48]Hadas Shachnai, Meirav Zehavi:
Parameterized Algorithms for Graph Partitioning Problems. WG 2014: 384-395 - [i6]Hadas Shachnai, Meirav Zehavi:
Faster Computation of Representative Families for Uniform Matroids with Applications. CoRR abs/1402.3547 (2014) - [i5]Hadas Shachnai, Meirav Zehavi:
Parameterized Algorithms for Graph Partitioning Problems. CoRR abs/1403.0099 (2014) - [i4]Dor Arad, Yael Mordechai, Hadas Shachnai:
Tighter Bounds for Makespan Minimization on Unrelated Machines. CoRR abs/1405.2530 (2014) - [i3]Hadas Shachnai, Meirav Zehavi:
FPT Algorithms for Weighted Graphs Can be (Almost) as Efficient as for Unweighted. CoRR abs/1407.2033 (2014) - 2013
- [j46]Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai:
Online selection of intervals and t-intervals. Inf. Comput. 233: 1-11 (2013) - [j45]Ariel Kulik, Hadas Shachnai, Tami Tamir:
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints. Math. Oper. Res. 38(4): 729-739 (2013) - [j44]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Corrigendum: Improved results for data migration and open shop scheduling. ACM Trans. Algorithms 9(4): 34:1-34:7 (2013) - [c47]Michael R. Fellows, Danny Hermelin, Frances A. Rosamond, Hadas Shachnai:
Tractable Parameterizations for the Minimum Linear Arrangement Problem. ESA 2013: 457-468 - [c46]Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir:
All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns. IPCO 2013: 13-24 - [c45]Viswanath Nagarajan, Baruch Schieber, Hadas Shachnai:
The Euclidean k-Supplier Problem. IPCO 2013: 290-301 - 2012
- [j43]Hadas Shachnai, Tami Tamir:
Approximation schemes for generalized two-dimensional vector packing with application to data placement. J. Discrete Algorithms 10: 35-48 (2012) - [j42]Keren Censor-Hillel, Hadas Shachnai:
Fast Information Spreading in Graphs with Large Weak Conductance. SIAM J. Comput. 41(6): 1451-1465 (2012) - [j41]Hadas Shachnai, Gal Tamir, Tami Tamir:
Minimal cost reconfiguration of data placement in a storage area network. Theor. Comput. Sci. 460: 42-53 (2012) - [c44]Sivan Albagli-Kim, Leah Epstein, Hadas Shachnai, Tami Tamir:
Packing Resizable Items with Application to Video Delivery over Wireless Networks. ALGOSENSORS 2012: 6-17 - [c43]Michael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai:
Parameterized Approximation via Fidelity Preserving Transformations. ICALP (1) 2012: 351-362 - [c42]Hadas Shachnai, Gal Tamir, Tami Tamir:
A Theory and Algorithms for Combinatorial Reoptimization. LATIN 2012: 618-630 - 2011
- [j40]Ariel Kulik, Hadas Shachnai, Oded Shmueli, Robert Sayegh:
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints. Theor. Comput. Sci. 412(52): 7087-7098 (2011) - [c41]Keren Censor-Hillel, Hadas Shachnai:
Fast Information Spreading in Graphs with Large Weak Conductance. SODA 2011: 440-448 - [i2]Ariel Kulik, Hadas Shachnai, Tami Tamir:
Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints. CoRR abs/1101.2940 (2011) - [i1]Klaus Jansen, Claire Mathieu, Hadas Shachnai, Neal E. Young:
Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). Dagstuhl Reports 1(2): 67-93 (2011) - 2010
- [j39]Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir:
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. Algorithmica 57(1): 44-61 (2010) - [j38]Ariel Kulik, Hadas Shachnai:
There is no EPTAS for two-dimensional knapsack. Inf. Process. Lett. 110(16): 707-710 (2010) - [j37]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks:
Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411(40-42): 3553-3562 (2010) - [c40]Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir:
Minimizing Busy Time in Multiple Machine Real-time Scheduling. FSTTCS 2010: 169-180 - [c39]Magnús M. Halldórsson, Hadas Shachnai:
Return of the Boss Problem: Competing Online against a Non-adaptive Adversary. FUN 2010: 237-248 - [c38]Keren Censor-Hillel, Hadas Shachnai:
Partial information spreading with application to distributed maximum coverage. PODC 2010: 161-170 - [c37]Unnar Th. Bachmann, Magnús M. Halldórsson, Hadas Shachnai:
Online Selection of Intervals and t-Intervals. SWAT 2010: 383-394
2000 – 2009
- 2009
- [j36]Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai:
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. Algorithmica 55(4): 643-665 (2009) - [j35]Hadas Shachnai, Lisa Zhang, Tomomi Matsui:
A note on generalized rank aggregation. Inf. Process. Lett. 109(13): 647-651 (2009) - [j34]Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Throughput maximization of real-time scheduling with batching. ACM Trans. Algorithms 5(2): 18:1-18:17 (2009) - [j33]Jirí Sgall, Hadas Shachnai, Tami Tamir:
Periodic scheduling with obligatory vacations. Theor. Comput. Sci. 410(47-49): 5112-5121 (2009) - [c36]Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Hadas Shachnai, Mordechai Shalom, Tami Tamir, Shmuel Zaks:
Minimizing total busy time in parallel scheduling with application to optical networks. IPDPS 2009: 1-12 - [c35]Ariel Kulik, Hadas Shachnai, Tami Tamir:
Maximizing submodular set functions subject to multiple linear constraints. SODA 2009: 545-554 - [c34]Hadas Shachnai, Gal Tamir, Tami Tamir:
Minimal Cost Reconfiguration of Data Placement in Storage Area Network. WAOA 2009: 229-241 - 2008
- [j32]Hadas Shachnai, Tami Tamir, Omer Yehezkely:
Approximation Schemes for Packing with Item Fragmentation. Theory Comput. Syst. 43(1): 81-98 (2008) - [j31]Hadas Shachnai, Lisa Zhang, Tomomi Matsui:
Exact algorithms for the master ring problem. Networks 52(2): 98-107 (2008) - [j30]Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai:
Improved bounds for scheduling conflicting jobs with minsum criteria. ACM Trans. Algorithms 4(1): 11:1-11:20 (2008)