Eden Chlamtac

From MaRDI portal
Person:1799230

Available identifiers

zbMath Open chlamtac.edenMaRDI QIDQ1799230

List of research outcomes





PublicationDate of PublicationType
Approximating red-blue set cover and minimum monotone satisfying assignment2025-01-14Paper
Approximating fair clustering with cascaded norm objectives2024-07-19Paper
https://portal.mardi4nfdi.de/entity/Q60843972023-10-31Paper
https://portal.mardi4nfdi.de/entity/Q58754622023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q50911902022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50095022021-08-04Paper
Approximating Spanners and Directed Steiner Forest2021-05-03Paper
https://portal.mardi4nfdi.de/entity/Q57434082019-05-10Paper
Lift-and-project methods for set cover and knapsack2018-10-18Paper
The Densest $k$-Subhypergraph Problem2018-07-18Paper
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds2018-07-16Paper
Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion2018-07-16Paper
Approximation Algorithms for Label Cover and The Log-Density Threshold2018-07-16Paper
The Densest k-Subhypergraph Problem2018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q29696102017-03-22Paper
Lowest-degree \(k\)-spanner: approximation and hardness2016-11-01Paper
Convex Relaxations and Integrality Gaps2016-04-26Paper
New approximation guarantee for chromatic number2014-11-25Paper
https://portal.mardi4nfdi.de/entity/Q31915702014-10-06Paper
Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph2014-08-13Paper
Linear Index Coding via Semidefinite Programming2014-04-16Paper
Lift-and-project methods for set cover and knapsack2013-08-12Paper
Understanding Set Cover: Sub-exponential Time Approximations and Lift-and-Project Methods2012-04-24Paper
Inapproximability of NP-Complete Variants of Nash Equilibrium2011-08-17Paper
Approximating sparsest cut in graphs of bounded treewidth2010-09-10Paper
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies2008-11-27Paper
Improved approximation of the minimum cover time2005-09-22Paper

Research outcomes over time

This page was built for person: Eden Chlamtac