Aggregation of Demand-Side Flexibilities: A Comparative Study of Approximation Algorithms by Emrah Öztürk, Klaus Rheinberger, Timm Faulwasser, Karl Worthmann, Markus Preißinger

“…The main contribution of this paper is a comparative evaluation of several approximation algorithms in terms of novel quality criteria, computational complexity, and communication effort using realistic data. …”
Get full text

Approximation algorithms for multi-multiway cut and multicut problems on directed graphs by Ramin Yarinezhad, Seyed Naser Hashemi

Subjects: “…approximation algorithm…”
Get full text

An Effective Approximation Algorithm for Second-Order Singular Functional Differential Equations by Mohammad Izadi, Hari M. Srivastava, Waleed Adel

Get full text

An approximation algorithm for the at least version of the generalized minimum spanning tree problem by Petrică C. Pop, Andrei Horvat-Marc, Corina Pop Sitar

Subjects: “…approximation algorithms…”
Get full text

An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free Graphs by Robbie King

“…We give an approximation algorithm for Quantum Max-Cut which works by rounding an SDP relaxation to an entangled quantum state. …”
Get full text

An Improved Approximation Algorithm for the Minimum Power Cover Problem with Submodular Penalty by Han Dai

Subjects: Get full text

Mixed-integer convex optimization : outer approximation algorithms and modeling power by Lubin, Miles (Miles C.)

Get full text

Structural rounding: Approximation algorithms for graphs near an algorithmically tractable class by Demaine, Erik D, Liu, Quanquan C., Vakilian, Ali

“…We develop a framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world networks) while still guaranteeing approximation ratios. …”
Get full text

Nonlinear formulations and improved randomized approximation algorithms for multiway and multicut problems

Get full text

A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees by Badoiu, Mihai, Indyk, Piotr, Sidiropoulos, Anastasios

Subjects: Get full text

A note on the greedy approximation algorithm for the unweighted set covering problem

Get full text

Nonlinear Formations and Improved Randomized Approximation Algorithms for Multiway and Multicut Problems by Bertsimas, Dimitris J., Teo, Chungpiaw, Vohra, Rakesh

Get full text

Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size by Moitra, Ankur

“…Our structural results are motivated by the meta question: Suppose we are given a poly(log n) approximation algorithm for a flow or cut problem when can we give a poly(log k) approximation algorithm for a generalization of this problem to a Steiner cut or flow problem? …”
Get full text
Get full text

Approximation algorithms via structural results for apex-minor-free graphs by Demaine, Erik D., Hajiaghayi, Mohammad Taghi, Kawarabayashi, Ken-ichi

“…We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for coloring within 2 of the optimal chromatic number, which is essentially best possible, and generalizes the seminal result by Thomassen [32] for bounded-genus graphs. …”
Get full text
Get full text

A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees by Badoiu, Mihai, Indyk, Piotr, Sidiropoulos, Anastasios

Subjects: Get full text

Approximation algorithms and hardness results for the joint replenishment Problepm with constant demands by Telha Cornejo, Claudio A., Schulz, Andreas S

Get full text
Get full text

Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times by Levi, Retsef, Shi, Cong

Get full text
Get full text

Adaptive Galerkin approximation algorithms for partial differential equations in infinite dimensions by Schwab, C, Suli, E

“…All constants in our error and complexity bounds are shown to be independent of the number of "active" coordinates identified by the proposed adaptive Galerkin approximation algorithms.…”

Location of bank accounts to optimize float : an analytic study of exact and approximate algorithms / by 186168 Cornuejols, Gerard, Fisher, Marshall L., Nemhauser, George L.

Stochastic Approximate Algorithms for Uncertain Constrained <i>K</i>-Means Problem by Jianguang Lu, Juan Tang, Bin Xing, Xianghong Tang

Subjects: “…stochastic approximate algorithms…”
Get full text