MohammadHossein Bateni

Available identifiers

zbMath Open bateni.mohammadhosseinMaRDI QIDQ693759

List of research outcomes

Publication	Date of Publication	Type
On complexity of 1-center in various metrics	2025-01-14	Paper
Optimal fully dynamic \(k\)-center clustering for adaptive and oblivious adversaries	2024-05-14	Paper
Fair Resource Allocation in a Volatile Marketplace	2022-02-18	Paper
Brief Announcement: MapReduce Algorithms for Massive Trees	2021-07-28	Paper
Streaming Belief Propagation for Community Detection	2021-06-09	Paper
Distributed balanced partitioning via linear embedding	2020-10-08	Paper
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs	2019-10-15	Paper
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs	2019-10-15	Paper
Fast algorithms for knapsack via convolution and prediction	2019-08-22	Paper
https://portal.mardi4nfdi.de/entity/Q5743427	2019-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q4633893	2019-05-06	Paper
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems	2018-07-06	Paper
https://portal.mardi4nfdi.de/entity/Q5365098	2017-09-29	Paper
A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting	2017-09-29	Paper
AN ANALYTICAL APPROACH FOR THERMAL STABILITY ANALYSIS OF TWO-LAYER TIMOSHENKO BEAMS	2017-04-07	Paper
Revenue Maximization for Selling Multiple Correlated Items	2015-11-19	Paper
MaxMin allocation via degree lower-bounded arborescences	2015-02-04	Paper
Revenue Maximization with Nonexcludable Goods	2015-01-12	Paper
Network Cournot Competition	2015-01-07	Paper
Concise Bid Optimization Strategies with Multiple Budget Constraints	2015-01-07	Paper
Submodular secretary problem and extensions	2014-12-05	Paper
Assignment problem in content distribution networks	2014-09-09	Paper
Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth	2014-08-13	Paper
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP	2014-07-25	Paper
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth	2014-02-17	Paper
Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems	2013-08-06	Paper
Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems	2013-08-05	Paper
Scheduling to minimize staleness and stretch in real-time data warehouses	2012-12-10	Paper
Euclidean prize-collecting Steiner forest	2012-04-26	Paper
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP	2011-07-29	Paper
Submodular Secretary Problem and Extensions	2010-09-10	Paper
Approximation Algorithms for the Directed k-Tour and k-Stroll Problems	2010-09-10	Paper
The Cooperative Game Theory Foundations of Network Bargaining Games	2010-09-07	Paper
Euclidean Prize-Collecting Steiner Forest	2010-04-27	Paper
A note on the subadditive network design problem	2009-11-17	Paper
https://portal.mardi4nfdi.de/entity/Q3601540	2009-02-10	Paper
Plane embeddings of planar graph metrics	2008-01-04	Paper

Research outcomes over time

This page was built for person: MohammadHossein Bateni