Publication

Hardness of Approximating Flow and Job Shop Scheduling Problems

Publications associées (30)

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Rico Zenklusen, Ola Nils Anders Svensson, Ashkan Norouzi Fard, Moran Feldman

We consider the classical problem of maximizing a monotone submodular function subject to a cardinality constraint, which, due to its numerous applications, has recently been studied in various computational models. We consider a clean multi-player model t ...

ASSOC COMPUTING MACHINERY2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

Li Jiang, Qi Yan

This letter studies the measurement scheduling problem for a group of

N

mobile robots moving on a flat surface that are preforming cooperative localization (CL). We consider a scenario in which due to the limited on-board resources such as battery life a ...

2020

A Crowdsourced Gameplay for Whole-Genome Assembly via Short Reads

Kalpani Anuradha Welivita

Next-generation sequencing has revolutionized the field of genomics by producing accurate, rapid and cost-effective genome analysis with the use of high throughput sequencing technologies. This has intensified the need for accurate and performance efficien ...

2020

Boolean satisfiability in quantum compilation

Giovanni De Micheli, Giulia Meuli, Mathias Soeken, Bruno Schmitt Antunes, Heinz Riener, Fereshte Mozafari Ghoraba

Quantum compilation is the task of translating a quantum algorithm implemented in a high-level quantum programming language into a technology-dependent instructions flow for a physical quantum computer. To tackle the large gap between the quantum program a ...

ROYAL SOC2020

A Computational Method for Identifying the Optimum Buffer Size in the Era of Zero Defect Manufacturing

Dimitrios Kyritsis, Ali Boujemaoui, Foivos Psarommatis Giannakopoulos

Decreasing defects, waste time, meeting customer demand and being adaptable are the goals of a Zero Defect Manufacturing (ZDM) strategy. Scheduling is an important tool to perform that. It should take in account buffer size allocation. In this study, a met ...

SPRINGER INTERNATIONAL PUBLISHING AG2020

Design of a quality control network for an international food company

Nicolas Zufferey, Philippe Wieser, Simone Lydia Voldrich

In this article, the design of a quality control network is considered in an entire supply chain, in the context of an international food and beverage company, denoted as ABC. For each possible control point of the network, two decisions have to be made: ( ...

TAYLOR & FRANCIS INC2020

Second-order guarantees in centralized, federated and decentralized nonconvex optimization

Ali H. Sayed, Stefan Vlaski

Rapid advances in data collection and processing capabilities have allowed for the use of increasingly complex models that give rise to nonconvex optimization problems. These formulations, however, can be arbitrarily difficult to solve in general, in the s ...

INT PRESS BOSTON, INC2020

Catechol Containing Polyelectrolyte Complex Nanoparticles as Local Drug Delivery System for Bortezomib at Bone Substitute Materials

Martin Guillermo Mueller, Jeremy Pak Hei Wong

The proteasome inhibitor bortezomib (BZM) is one of the most potent anti-cancer drugs in the therapy of multiple myeloma. In this study, an adhesive drug delivery system (DDS) for BZM was developed. Therefore, we extended the present DDS concept of polyele ...

2020

Graph fragmentation problem: analysis and synthesis

Manuel Francesco Aprile, Pablo Romero Gómez

Vulnerability metrics play a key role in the understanding of cascading failures and target/random attacks to a network. The graph fragmentation problem (GFP) is the result of a worst-case analysis of a random attack. We can choose a fixed number of indivi ...

WILEY2019

Publications associées (30)

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Rico Zenklusen, Ola Nils Anders Svensson, Ashkan Norouzi Fard, Moran Feldman

ASSOC COMPUTING MACHINERY2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

Li Jiang, Qi Yan

This letter studies the measurement scheduling problem for a group of

N

mobile robots moving on a flat surface that are preforming cooperative localization (CL). We consider a scenario in which due to the limited on-board resources such as battery life a ...

2020

Catechol Containing Polyelectrolyte Complex Nanoparticles as Local Drug Delivery System for Bortezomib at Bone Substitute Materials

Martin Guillermo Mueller, Jeremy Pak Hei Wong

2020

Graph fragmentation problem: analysis and synthesis

Manuel Francesco Aprile, Pablo Romero Gómez

WILEY2019