Publications related to Nanoparticle actuated hollow drug delivery vehicles

The double exponential runtime is tight for 2-stage stochastic ILPs

Kim-Manuel Klein, Klaus Jansen, Alexandra Anna Lassota

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

SPRINGER HEIDELBERG2022

Automating cutting planes is NP-hard

Mika Tapani Göös

We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula F, It is -hard to find a CP refutation of F in time polynomial in the length of the shortest such refutation; and unless Gap-Hitting-Set admits a nontrivial algorithm, ...

ACM2021

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

Qi Yan, Li Jiang

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

On the effect of ligand shell heterogeneity on nanoparticle/protein binding thermodynamics

Francesco Stellacci, Ahmet Bekdemir, Suiyang Liao

Nonspecific protein adhesion to nanoparticle (NP) has been proven to have important implications in nanomedicine. However, there are only a few examples of careful studies relating protein binding thermodynamics to NP physicochemical features. In particula ...

2019

On Separable Quadratic Lyapunov Functions for Convex Design of Distributed Controllers

Maryam Kamgarpour, Luca Furieri

We consider the problem of designing a stabilizing and optimal static controller with a pre-specified sparsity pattern. Since this problem is NP-hard in general, it is necessary to resort to approximation approaches. In this paper, we characterize a class ...

IEEE2019

Adaptive Streaming in Interactive Multiview Video Systems

Pascal Frossard, Laura Toni, Xue Zhang, Yao Zhao

Multiview applications endow final users with the possibility to freely navigate within 3D scenes with minimum-delay. A real feeling of scene navigation is enabled by transmitting multiple high-quality camera views, which can be used to synthesize addition ...

2019

Hardness Results for Consensus-Halving

Jie Zhang, Aris Filos Ratsikas

The Consensus-halving problem is the problem of dividing an object into two portions, such that each of n agents has equal valuation for the two portions. We study the epsilon-approximate version, which allows each agent to have an epsilon discrepancy on t ...

Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik2018

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

Bernard Moret, Mingfu Shao

A fundamental problem in comparative genomics is to compute the distance between two genomes. For two genomes without duplicate genes, we can easily compute a variety of distance measures in linear time, but the problem is NP-hard under most models when ge ...

Mary Ann Liebert, Inc2016

Improved hardness results for unique shortest vector problem

Divesh Aggarwal

The unique shortest vector problem on a rational lattice is the problem of finding the shortest non-zero vector under the promise that it is unique (up to multiplication by -1). We give several incremental improvements on the known hardness of the unique s ...

Elsevier2016

Virtually Moving Base Stations for Energy Efficiency in Wireless Sensor Networks

Martin Vetterli, Patrick Thiran, Runwei Zhang

Energy efficiency of wireless sensor networks (WSNs) can be improved by moving base stations (BSs), as this scheme evenly distributes the communication load in the network. However, physically moving BSs is complicated and costly. In this paper, we propose ...

2015

Nanoparticle actuated hollow drug delivery vehicles

Graph Chatbot

Chat with Graph Search

The double exponential runtime is tight for 2-stage stochastic ILPs

Automating cutting planes is NP-hard

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

On the effect of ligand shell heterogeneity on nanoparticle/protein binding thermodynamics

On Separable Quadratic Lyapunov Functions for Convex Design of Distributed Controllers

Adaptive Streaming in Interactive Multiview Video Systems

Hardness Results for Consensus-Halving

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

Improved hardness results for unique shortest vector problem

Virtually Moving Base Stations for Energy Efficiency in Wireless Sensor Networks

Automating cutting planes is NP-hard

Virtually Moving Base Stations for Energy Efficiency in Wireless Sensor Networks

The double exponential runtime is tight for 2-stage stochastic ILPs

On the effect of ligand shell heterogeneity on nanoparticle/protein binding thermodynamics

Improved hardness results for unique shortest vector problem

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

Adaptive Streaming in Interactive Multiview Video Systems

Hardness Results for Consensus-Halving

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

On Separable Quadratic Lyapunov Functions for Convex Design of Distributed Controllers