Search Results - "Doron-Arad, Ilan" :: K.UTB vyhledávací portál

Loading…

An FPTAS for budgeted laminar matroid independent set

by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas
Published in Operations research letters (01.11.2023)

Get full text

Journal Article

Loading…

An APTAS for Bin Packing with Clique-Graph Conflicts

by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas
Published in Algorithms and Data Structures (2021)

Get full text

Book Chapter

Loading…

Non-Linear Paging

by Doron-Arad, Ilan, Joseph, Naor
Year of Publication 20.04.2024

Get full text

Journal Article

Loading…

Tight Bounds for Budgeted Maximum Weight Independent Set in Bipartite and Perfect Graphs

by Doron-Arad, Ilan, Shachnai, Hadas
Year of Publication 17.07.2023

Get full text

Journal Article

Loading…

Approximating Bin Packing with Conflict Graphs via Maximization Techniques

by Doron-Arad, Ilan, Shachnai, Hadas
Year of Publication 21.02.2023

Get full text

Journal Article

Loading…

Unsplittable Flow on a Short Path

by Doron-Arad, Ilan, Grandoni, Fabrizio, Kulik, Ariel
Year of Publication 14.07.2024

Get full text

Journal Article

Loading…

Fine Grained Lower Bounds for Multidimensional Knapsack

by Doron-Arad, Ilan, Kulik, Ariel, Manurangsi, Pasin
Year of Publication 14.07.2024

Get full text

Journal Article

Loading…

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding

by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas
Year of Publication 24.08.2023

Get full text

Journal Article

Loading…

Lower Bounds for Matroid Optimization Problems with a Linear Constraint

by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas
Year of Publication 15.07.2023

Get full text

Journal Article

Loading…

Budgeted Matroid Maximization: a Parameterized Viewpoint

by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas
Year of Publication 09.07.2023

Get full text

Journal Article

Loading…

An FPTAS for Budgeted Laminar Matroid Independent Set

by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas
Year of Publication 27.04.2023

Get full text

Journal Article

Loading…

An EPTAS for Budgeted Matching and Budgeted Matroid Intersection

by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas
Year of Publication 11.02.2023

Get full text

Journal Article

Loading…

Bin Packing with Partition Matroid can be Approximated within $o(OPT)$ Bins

by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas
Year of Publication 02.12.2022

Get full text

Journal Article

Loading…

An EPTAS for Budgeted Matroid Independent Set

by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas
Year of Publication 10.09.2022

Get full text

Journal Article

Loading…

Non-Linear Paging

by Doron-Arad, Ilan, Joseph, Naor
Published in arXiv.org (20.04.2024)

Get full text

Paper

Loading…

Tight Bounds for Budgeted Maximum Weight Independent Set in Bipartite and Perfect Graphs

by Doron-Arad, Ilan, Shachnai, Hadas
Published in arXiv.org (17.07.2023)

Get full text

Paper

Loading…

An APTAS for Bin Packing with Clique-graph Conflicts

by Doron-Arad, Ilan, Kulik, Ariel, Shachnai, Hadas
Year of Publication 09.11.2020

Get full text

Journal Article

Loading…

Approximations and Hardness of Packing Partially Ordered Items

by Doron-Arad, Ilan, Kortsarz, Guy, Naor, Joseph, Schieber, Baruch, Shachnai, Hadas
Year of Publication 03.03.2024

Get full text

Journal Article

Loading…

Approximating Bin Packing with Conflict Graphs via Maximization Techniques

by Doron-Arad, Ilan, Shachnai, Hadas
Published in arXiv.org (21.02.2023)

Get full text

Paper

Loading…

Unsplittable Flow on a Short Path

by Doron-Arad, Ilan, Grandoni, Fabrizio, Kulik, Ariel
Published in arXiv.org (14.07.2024)

Get full text

Paper

Refine Results

Format

Subject Area

Topic

Language

Year of Publication

Database