206 Infos zu Maxim Sviridenko

2 Aktuelle Nachrichten

— Maxim Sviridenko joins the Department of Computer Science as a new Professor in January Maxim obtained his PhD in Applied Mathematics ...

Matthias Hamann (Universität Hamburg) On the Tree-likeness of DIMAP seminar. Maxim Sviridenko (IBM T.J. Watson Research Centre)

27 Profile in Sozialen Netzwerken

Sehen Sie sich das Profil von Maxim Sviridenko auf LinkedIn an, dem weltweit größten beruflichen Netzwerk. Maxim Sviridenko hat 9 Jobs im Profil angegeben.

2 Infos zur Ausbildung

Maxim Sviridenko, Jan Vondrak, Justin Ward: Optimal approximation for submodular and supermodular optimization with bounded curvature. Math. Oper. Res.

Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver and Falk Unger ... Nikhil Bansal, Alberto Caprara and Maxim Sviridenko.

21 Bücher zum Namen

Verfasserangabe: Lisa Fleischer; Michel X. Goemans; Vahab S. Mirrokni; Maxim Sviridenko. Jahr: Beteiligte Person: Fleischer, Lisa; Goemans, Michel X.; ...

371 results — Previous affiliations of Maxim Sviridenko include Aarhus University & Massachusetts Institute of Technology. The author has done significant research ...

This book constitutes the refereed proceedings of the 17th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2014, held in...

... Tracy Kimbrel, Konstantin Makarychev, and Maxim Sviridenko IBM T.J. Watson research center, Yorktown Heights, NY , USA {rohitk,kimbrel,konstantin ...

9 Dokumente

Curriculum Vitae Maxim Sviridenko Professional Experience 1. February, present: Principal Research Scientist, Scalable Machine Learning Group, Yahoo! Lab…

von M Sviridenko · · Zitiert von: 193 — Optimal approximation for submodular and supermodular optimization with bounded curvature. Authors:Maxim Sviridenko, Jan Vondrák, Justin Ward.

... for Unweighted Graphs Viswanath Nagarajan and Maxim Sviridenko The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite ...

IV Kanatchikov (II ITP, Univ. of Hamburg). The diameter of a long range percolation graph. Don Coppersmith, David Gamarnik, Maxim Sviridenko. New proof of ...

31 Wissenschaftliche Publikationen

Search for US Patents Issued by the USPTO in December 2007

Viswanath Nagarajan, Maxim Sviridenko. IBM T. J. Watson Research Center, Yorktown Heights, New York &#.com, .com}.

List of computer science publications by Maxim Sviridenko

Kyriakos Axiotis, Maxim Sviridenko: Local Search Algorithms for Rank-Constrained Convex Optimization ...

7 Allgemeine Veröffentlichungen

von R Saket · · Zitiert von: 14 — Rishi Saket &; Maxim Sviridenko. Conference paper Accesses. 3 Citations. Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7408) ...

Configuration-LPs have proved to be successful in the design and analysis of approximation algorithms for a variety of discrete optimization problems. In...

We design a new approximation algorithm for the metric uncapacitated facility location problem. This algorithm is of LP rounding type and is based on a...

Oktay Günlük and Jeff Linderoth ... James Ostrowski, Jeff Linderoth, Fabrizio Rossi, and. Stefano ... Magnús M. Halldórsson, Guy Kortsarz, and Maxim Sviridenko.

2 Video- & Audioinhalte

AboutPressCopyrightContact usCreatorsAdvertiseDevelopersTermsPrivacyPolicy & SafetyHow YouTube worksTest new features. © Google LLC ...

· However, the optimal constant Cq was not known. We show that the optimal constant is Cq=Aq. This is a joint work with Maxim Sviridenko, ...

3 Meinungen & Artikel

The Hamiltonian completion problem is to find the minimal number of edges to add to a graph ... Jump up ^ David Gamarnik, Maxim Sviridenko, Hamiltonian completions of sparse random graphs, Discrete Applied Mathematics 152 (2005) ...

Tracking the l2 Norm with Constant Update TimeBenjamin Moseley and Maxim Sviridenko. Submodular Optimization with Contention Resolution ExtensionsD ...

von K Axiotis · · Zitiert von: 2 — Kyriakos Axiotis, Maxim Sviridenko. 28 Sept (modified: 10 Feb 2022)ICLR PosterReaders: EveryoneShow BibtexShow Revisions.

99 Webfunde aus dem Netz

View Maxim Sviridenko's profile on LinkedIn, the world's largest professional community. Maxim has 2 jobs listed on their profile. See the complete profile on ...

View Maxim Sviridenko's profile on LinkedIn, the world's largest professional community. Maxim has 1 job listed on their profile. See the complete profile on ...

快到全球最大的專業人士人脈網查看Maxim Sviridenko的檔案！Maxim新增了：4 個職務。查看完整檔案，進一步探索Maxim的人脈和相關職缺。

Maxim Sviridenkos berufliches Profil anzeigen LinkedIn ist das weltweit größte berufliche Netzwerk, das Fach- und Führungskräften wie Maxim Sviridenko dabei ...

View Maxim Sviridenko's professional profile on LinkedIn. LinkedIn is the world's largest business network, helping professionals like Maxim Sviridenko discover ...

... weergeven… Yuval Filmus,; Maxim Sviridenko,; Roy Schwartz,; Joseph Seffi Naor,; Moran Feldman,; Perry Alexander,; Marek Adamczyk,; Stanislav Živný ...

Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko. Maximizing To appear in: OR2016 (Hamburg) proceedings (Springer). You can get ...

Problems d-dim Vector Packing: Each item d-dim vector. Packing valid if each co-ordinate wise sum · 1 Set Cover: Items i 1, …, i n Sets C 1,…,C m. Choose...

Maxim Sviridenko. Senior Director New York, New York. I received my Ph.D. at the Sobolev Institute of Mathematics (Russia) in

Maxim Sviridenko. Experience: PPP директор Проекта, ООО "Компания "Базовый Элемент"; Senior business development officer ...

Many Applications  Cloth cutting, steel cutting, wood cutting  Truck Loading  Placing ads in newspapers  Memory allocation in paging systems  …

Maxim Sviridenko. New York, New York. I received my Ph.D. at the Sobolev Institute of Mathematics (Russia) in Since then I have worked as a Research ...

Large Neighborhood Local Search for the Maximum Set Packing Problem - Maxim Sviridenko In this paper we consider the classical maximum set packing ...

Inapproximability of the Multi- Level Facility Location Problem Ravishankar Krishnaswamy Carnegie Mellon University (joint with Maxim Sviridenko)

I received my Ph.D. at the Sobolev Institute of Mathematics (Russia) in Since then I have worked as a Research Staff Member at the Department of ... Es fehlt: linde

by; Kyriakos Axiotis,; Maxim Sviridenko. 8 views; May 3, :44. Sparse Convex Optimization via Adaptively Regularized Hard Thresholding (ARHT) ...

Packing Rectangles into Bins Nikhil Bansal (CMU) Joint with Maxim Sviridenko (IBM)

According to our current on-line database, Maxim Sviridenko has 1 student and 1 descendant. We welcome any additional information. If you have additional ...

Cost Structures in Network Design

CiteSeerX - Scientific documents that cite the following paper: Vahab Mirrokni and Maxim Sviridenko. Tight approximation algorithms for maximum general...