32 Hits in 6.5 sec

Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs [chapter]

Marc Lelarge, Hang Zhou
2013 Lecture Notes in Computer Science  
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2017. To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack.  ...  Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack -SODA conference, Spain, 2017 Network Inference: Graph Reconstruction and Verification -Joint lecture series of the  ... 
doi:10.1007/978-3-642-45030-3_14 fatcat:cs27muh23fgejlpec7j3pdqmie

Better Approximations for General Caching and UFP-Cover Under Resource Augmentation

Andrés Cristi, Andreas Wiese, Markus Bläser, Christophe Paul
2020 Symposium on Theoretical Aspects of Computer Science  
We extend this result to general caching and to the packing version of Unsplittable Flow on a Path in their respective natural resource augmentation settings.  ...  In the Unsplittable Flow on a Path Cover (UFP-cover) problem we are given a path with a demand for each edge and a set of tasks where each task is defined by a subpath, a size and a cost.  ...  General caching can be modeled by a covering problem which turns out to be the natural covering variant of the well-studied Unsplittable Flow on a Path problem (UFP) [13, 6, 1, 18] .  ... 
doi:10.4230/lipics.stacs.2020.44 dblp:conf/stacs/CristiW20 fatcat:hqojwevv6nf47f2up6vg5alk6e

On consistent migration of flows in SDNs

Sebastian Brandt, Klaus-Tycho Forster, Roger Wattenhofer
2016 IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications  
However, if all flows must be integer or are unsplittable, this is NP-hard to decide.  ...  A similar problem is providing increased bandwidth to an application, while keeping all other flows in the network, but possibly migrating them consistently to other paths.  ...  The case of just one logical source or destination was recently covered in [22] via the method of augmenting flows, allowing to migrate flows in a linear number of updates.  ... 
doi:10.1109/infocom.2016.7524332 dblp:conf/infocom/BrandtFW16 fatcat:6lhe6fusqrfxbj25hzgenmlejm

Survey of Consistent Software-Defined Network Updates

Klaus-Tycho Foerster, Stefan Schmid, Stefano Vissicchio
2018 IEEE Communications Surveys and Tutorials  
, increasing traffic, or failures.  ...  This paper presents a structured survey of mechanism and protocols to update computer networks in a fast and consistent manner.  ...  ACKNOWLEDGEMENTS For inputs and feedback, we would like to thank Marco Canini, Nate Foster, Dejan Kostić, Ratul Mahajan, Roger Wattenhofer, and Jiaqi Zheng.  ... 
doi:10.1109/comst.2018.2876749 fatcat:wcegero4tvbmrkfogpqw6ze3ce

The Demand Matching Problem [chapter]

Bruce Shepherd, Adrian Vetta
2002 Lecture Notes in Computer Science  
A fully polynomial approximation scheme is also presented for the problem on a tree, thus generalising a well-known result for the knapsack problem.  ...  A subset M of edges is feasible if for each node v the total demand of edges in M incident to v is at most b v . We examine the system of star inequalities for this problem.  ...  The work grew, in a convoluted way, out of discussions in 1998 with Vincenzo Liberatore on maximum multicommodity flow in a path.  ... 
doi:10.1007/3-540-47867-1_32 fatcat:meblql72zndg7ke7anhtuhf74i

The Demand-Matching Problem

F. B. Shepherd, A. Vetta
2007 Mathematics of Operations Research  
A fully polynomial approximation scheme is also presented for the problem on a tree, thus generalising a well-known result for the knapsack problem.  ...  A subset M of edges is feasible if for each node v the total demand of edges in M incident to v is at most b v . We examine the system of star inequalities for this problem.  ...  The work grew, in a convoluted way, out of discussions in 1998 with Vincenzo Liberatore on maximum multicommodity flow in a path.  ... 
doi:10.1287/moor.1070.0254 fatcat:622hxkjd4jbl5oh5eucouceqwm

Fair optimization of mesh-connected WLAN hotspots

Peter Dely, Fabio D'Andreagiovanni, Andreas Kassler
2013 Wireless Communications and Mobile Computing  
However, this connection policy may lead to: (i) unfairness towards users that are distant from gateways; (ii) uneven distribution of users to MAPs; and (iii) inefficient use of network paths.  ...  Because of the inherent complexity of the problem, real size instances cannot be solved to optimality within the time limits for online optimization.  ...  The work was financially supported by Deutsche Telekom Innovation Laboratories as well as by the German Federal Ministry of Education and Research (BMBF), project ROBUKOM [50] , grant 03MS616E.  ... 
doi:10.1002/wcm.2393 fatcat:5yrse2nsfbegzmrjdy76rv73te

Approximation and Complexity of k–Splittable Flows [chapter]

Ronald Koch, Martin Skutella, Ines Spenke
2006 Lecture Notes in Computer Science  
One has to decide on k paths (routing) and on the flow values on these paths (packing).  ...  Given a graph with a source and a sink node, the N P -hard maximum k-splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most k paths [6] .  ...  It is well known that a maximum s, t-flow can be computed in polynomial time, for example, by augmenting path algorithms.  ... 
doi:10.1007/11671411_19 fatcat:tpc4vpwl4vguzgtbnapt4o5r4i

Solving the bifurcated and nonbifurcated robust network loading problem with k -adaptive routing

Marco Silva, Michael Poss, Nelson Maculan
2018 Networks  
Named k-adaptive, it is based on the fact that the decision-maker chooses k second-stage solutions and then commits to one of them only after realization of the uncertainty.  ...  This routing scheme, with its corresponding k-partition of the uncertainty set, is dynamically defined under an iterative method to sequentially improve the solution.  ...  We work with two cases: one in which flows are unsplittable, or nonbifurcated, and must use a single path, and another one in which flows are splittable, or bifurcated, and can be fractionally split among  ... 
doi:10.1002/net.21807 fatcat:prs3mladyjfgtnw2aar7duerbm

Mobility aware virtual network embedding

Giorgos Chochlidakis, Vasilis Friderikos
2015 2015 IEEE International Conference on Communications (ICC)  
The main purpose of this paper is to provide an optimization framework for optimal virtual network embedding, including a heuristic algorithm with low computational complexity, by explicitly considering  ...  Numerical investigations reveal that the effect of user mobility has a significant impact on the design of virtual networks.  ...  The authors would also like to acknowledge the contribution of their colleagues within the H2020-ICT-2014-2 5G NORMA project; although the views expressed are those of the authors and do not necessarily  ... 
doi:10.1109/icc.2015.7249254 dblp:conf/icc/ChochlidakisF15 fatcat:ate4qhjykvc6fhfdl45rbi6ogm

The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs

Tobias Achterberg, Christian Raack
2010 Mathematical Programming Computation  
But also the routing of demands might be discrete in the sense that it is restricted to single-path or integer flows.  ...  In the mathematical literature there is a vast variety of approaches to model and solve network design problems depending on the requirements to incorporate.  ...  To model unsplittable flow one typically introduces binary flow-variables f k a that state whether or not the flow of commodity k uses arc a.  ... 
doi:10.1007/s12532-010-0015-3 fatcat:sb35hvya5vdx7dzyhlyo5mnd4i

Combinatorial Optimization of Alternating Current Electric Power Systems

Sid Chi-Kin Chau, Khaled Elbassioni, Majid Khonji
2018 Foundations and Trends® in Electric Energy Systems  
The main idea of this monograph is to draw on new extensions of discrete combinatorial optimization with linear constraints, like knapsack and unsplittable flow problems.  ...  Note that S i,j is not symmetric, namely, |S i,j | is not equivalent to |S j,i |, the power flowing in the opposite direction.  ...  Second Order Cone Programming A Second-order cone program (SOCP) is a convex optimization problem in which a linear objective function is maximized or minimized subject to 2 -norm constraints of the following  ... 
doi:10.1561/3100000017 fatcat:7cxxw4lt3bd3rmtrcqeygoream


Joo Seong Jeong, Jingyu Lee, Donghyun Kim, Changmin Jeon, Changjin Jeong, Youngki Lee, Byung-Gon Chun
2022 Proceedings of the 20th Annual International Conference on Mobile Systems, Applications and Services  
Evaluation results on mobile platforms show that our system outperforms TensorFlow Lite, a state-of-the-art mobile inference framework, by up to 5.04× for single-app workloads involving multiple DNNs.  ...  Fallback operators, which are not supported by certain mobile processors, are also considered when generating subgraphs.  ...  This work was supported by Samsung Research Funding & Incubation Center of Samsung Electronics under project number SRFC-IT2001-03.  ... 
doi:10.1145/3498361.3538948 fatcat:7k4tsanspnekhnsvj7n7zugtiq

Minimum color‐degree perfect b ‐matchings

Mariia Anapolska, Christina Büsing, Martin Comis, Tabea Krabs
2020 Networks  
If no-one asks, you can start off the debate by asking a session yourself. In any case, keep all slots to exactly 30 minutes (parallel sessions regime).  ...  Schrader, and Graphs III (Wed 20, Room PP, 9:30-10:30) chaired by R. Cordone. Session chairs must remind speakers to load up slides on laptops, and keep the sessions on time.  ...  Preliminary computational experiments show that the MWU Algorithm is able to recover a solution to which a lower value of the slack variable is associated; on the contrary the MS produces a worse solution  ... 
doi:10.1002/net.21974 fatcat:4qgtutmxrrcy7anvxks4fivcii

Approximation Algorithms for NP-Hard Problems

Ravindran Kannan, Marek Karpinski
2004 Oberwolfach Reports  
It is an interesting artifact that most computational tasks today that arise in realistic scenarios are intractable, at least if one insists on delivering exact solutions with certainty within a strict  ...  One of the great recent successes in that area has been the discovery of a new paradigm connecting probabilistic proof verification theory to the theory of approximate computation as well as some new probabilistic  ...  Acknowledgements This research was supported by The Israel Science Foundation (grant No. 263/02).  ... 
doi:10.4171/owr/2004/28 fatcat:fwbs36pgpjev5gk6cfeb7ylukm
« Previous Showing results 1 — 15 out of 32 results