Publications related to Polychromatic colorings of arbitrary rectangular partitions

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

Minimum Cost Intervention Design for Causal Effect Identification

Negar Kiyavash, Sina Akbari, Seyed Jalal Etesami

Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to perform a collection of often costly interventions in the system to learn the ...

PMLR2022

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

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

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 ...

ACM New York2015

Polychromatic colorings of arbitrary rectangular partitions

Graph Chatbot

Chat with Graph Search

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

Minimum Cost Intervention Design for Causal Effect Identification

Automating cutting planes is NP-hard

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

Improved hardness results for unique shortest vector problem

Virtually Moving Base Stations for Energy Efficiency in Wireless Sensor Networks

Virtually Moving Base Stations for Energy Efficiency in Wireless Sensor Networks

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

Minimum Cost Intervention Design for Causal Effect Identification

Automating cutting planes is NP-hard

A Fast and Exact Algorithm for the Exemplar Breakpoint Distance

Virtually Moving Base Stations for Energy Efficiency in Wireless Sensor Networks

Virtually Moving Base Stations for Energy Efficiency in Wireless Sensor Networks

Adaptive Streaming in Interactive Multiview Video Systems

Measurement Scheduling for Cooperative Localization in Resource-Constrained Conditions

Hardness Results for Consensus-Halving

Improved hardness results for unique shortest vector problem