Search results for "k-Splittable"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
86	Massimiliano Caramia, Antonino Sgalambro	A fast heuristic algorithm for the maximum concurrent k-splittable flow problem.	Optim. Lett.	2010	DBLP DOI BibTeX RDF	k-Splittable flow, Maximum concurrent flow, Multicommodity, Heuristic, Throughput
86	Ronald Koch, Martin Skutella, Ines Spenke	Maximum k -Splittable s , t -Flows.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	k-Splittable, s, t-Flow, Polynomial time approximation scheme, Bounded treewidth
85	Jiangzhuo Chen, Robert D. Kleinberg, László Lovász 0001, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta	(Almost) Tight bounds and existence theorems for single-commodity confluent flows.	J. ACM	2007	DBLP DOI BibTeX RDF	confluent flow, routing, Approximation algorithms, network flow, tight bounds
85	Jiangzhuo Chen, Robert D. Kleinberg, László Lovász 0001, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta	(Almost) tight bounds and existence theorems for confluent flows.	STOC	2004	DBLP DOI BibTeX RDF	confluent flow, routing, approximation algorithms, network flow, tight bounds
69	Massimiliano Caramia, Antonino Sgalambro	An exact approach for the maximum concurrent k -splittable flow problem.	Optim. Lett.	2008	DBLP DOI BibTeX RDF	k-splittable flow, Multicommodity, Throughput, Branch and bound, Mixed integer programming
69	Leah Epstein, Rob van Stee	Online scheduling of splittable tasks.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	splittable tasks, scheduling, Online algorithms
56	Martin Gairing, Burkhard Monien, Karsten Tiemann	Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions.	ICALP (1)	2006	DBLP DOI BibTeX RDF
56	Ronald Koch, Martin Skutella, Ines Spenke	Approximation and Complexity of k-Splittable Flows.	WAOA	2005	DBLP DOI BibTeX RDF
56	Maren Martens, Martin Skutella	Length-Bounded and Dynamic k-Splittable Flows.	OR	2005	DBLP DOI BibTeX RDF
51	Mong-Jen Kao, Chung-Shou Liao	Capacitated Domination Problem.	ISAAC	2007	DBLP DOI BibTeX RDF
51	Maren Martens, Fernanda Salazar, Martin Skutella	Convex Combinations of Single Source Unsplittable Flows.	ESA	2007	DBLP DOI BibTeX RDF
51	Baruch Awerbuch, Yossi Azar, Amir Epstein	The Price of Routing Unsplittable Flow.	STOC	2005	DBLP DOI BibTeX RDF	game theory, nash equilibria, selfish routing, unsplittable flow
39	Tobias Harks	Stackelberg Strategies and Collusion in Network Games with Splittable Flow.	WAOA	2008	DBLP DOI BibTeX RDF
39	Leah Epstein, Rob van Stee	Approximation Schemes for Packing Splittable Items with Cardinality Constraints.	WAOA	2007	DBLP DOI BibTeX RDF
39	Vladimir V. Mazalov, Burkhard Monien, Florian Schoppmann, Karsten Tiemann	Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic.	WINE	2006	DBLP DOI BibTeX RDF
39	Georg Baier, Ekkehard Köhler, Martin Skutella	The k-Splittable Flow Problem.	Algorithmica	2005	DBLP DOI BibTeX RDF	Max-flow min-cut, Approximation algorithm, Network flow, Unsplittable flow
39	Leah Epstein, Rob van Stee	Online Scheduling of Splittable Tasks in Peer-to-Peer Networks.	SWAT	2004	DBLP DOI BibTeX RDF
39	Amit Agarwal, Tarun Agarwal, Sumit Chopra, Anja Feldmann, Nils Kammenhuber, Piotr Krysta, Berthold Vöcking	An Experimental Study of k-Splittable Scheduling for DNS-Based Traffic Allocation.	Euro-Par	2003	DBLP DOI BibTeX RDF
39	Georg Baier, Ekkehard Köhler, Martin Skutella	On the k-Splittable Flow Problem.	ESA	2002	DBLP DOI BibTeX RDF
34	Ron Banner, Ariel Orda	Bottleneck Routing Games in Communication Networks.	IEEE J. Sel. Areas Commun.	2007	DBLP DOI BibTeX RDF
34	Chaitanya Swamy	The effectiveness of Stackelberg strategies and tolls for network congestion games.	SODA	2007	DBLP BibTeX RDF
34	Hai Liu 0001, Deying Li 0001, Xiaohua Jia	QoS Topology Control with Minimal Total Energy Cost in Ad Hoc Wireless Networks.	MSN	2006	DBLP DOI BibTeX RDF
34	Jiangzhuo Chen, Ravi Sundaram, Madhav V. Marathe, Rajmohan Rajaraman	The Confluent Capacity of the Internet: Congestion vs. Dilation.	ICDCS	2006	DBLP DOI BibTeX RDF
34	Jian Tang 0008, Guoliang Xue, Weiyi Zhang 0001	Interference-aware topology control and QoS routing in multi-channel wireless mesh networks.	MobiHoc	2005	DBLP DOI BibTeX RDF	wireless mesh network, topology control, QoS routing, channel assignment
34	Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram	Meet and merge: approximation algorithms for confluent flows.	STOC	2003	DBLP DOI BibTeX RDF	confluent flow, routing, approximation algorithms, randomization, network flow, multicommodity flow, rounding
34	Jens R. Woinowski	A Normal Form for Church-Rosser Language Systems.	RTA	2001	DBLP DOI BibTeX RDF
34	Alan J. Hanna, T. Brian M. McMaster	Splittability for Partially Ordered Sets.	Order	2000	DBLP DOI BibTeX RDF	splittability, partially ordered set
22	Jonathan Jedwab, Shuxing Li, Samuel Simon	Constructions and Restrictions for Balanced Splittable Hadamard Matrices.	Electron. J. Comb.	2023	DBLP DOI BibTeX RDF
22	G. Jaykrishnan, Asaf Levin	EPTAS for the dual of splittable bin packing with cardinality constraint.	Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
22	Rui Zhang, Xuesen Chu, Ruhui Ma, Meng Zhang, Liwei Lin, Honghao Gao, Haibing Guan	OSTTD: Offloading of Splittable Tasks With Topological Dependence in Multi-Tier Computing Networks.	IEEE J. Sel. Areas Commun.	2023	DBLP DOI BibTeX RDF
22	Matthew Casey, Rajmohan Rajaraman, David Stalfa	Scheduling Splittable Jobs on Configurable Machines.	CoRR	2023	DBLP DOI BibTeX RDF
22	Yiding Liu, Yinglei Teng, Tao Niu	Splittable Pattern-Specific Weight Pruning for Deep Neural Networks.	ICME	2023	DBLP DOI BibTeX RDF
22	Jiacheng Wang 0004, Jianhui Zhang, Liming Liu, Xuzhao Zheng, Hanxiang Wang, Zhigang Gao	Utility Maximization for Splittable Task Offloading in IoT Edge Network.	Comput. Networks	2022	DBLP DOI BibTeX RDF
22	Gabriel Matheus de Almeida, Leizer de Lima Pinto, Cristiano Bonato Both, Kleber Vieira Cardoso	Optimal Joint Functional Split and Network Function Placement in Virtualized RAN With Splittable Flows.	IEEE Wirel. Commun. Lett.	2022	DBLP DOI BibTeX RDF
22	Jonathan Jedwab, Shuxing Li, Samuel Simon	Constructions and restrictions for balanced splittable Hadamard matrices.	CoRR	2022	DBLP DOI BibTeX RDF
22	G. Jaykrishnan, Asaf Levin	EPTAS for the dual of splittable bin packing with cardinality constraint.	CoRR	2022	DBLP DOI BibTeX RDF
22	Sumaiya Tabassum Nimi, Md. Adnan Arefeen, Md. Yusuf Sarwar Uddin, Biplob Debnath, Srimat Chakradhar	Chimera: Context-Aware Splittable Deep Multitasking Models for Edge Intelligence.	SMARTCOMP	2022	DBLP DOI BibTeX RDF
22	Hongyang Liu, Ying Wang 0002, Peng Yu 0001, Yining Feng, Wenjing Li 0001, Xuesong Qiu 0001	Satellite Relay Task Scheduling Based on Dynamic Antenna Setup Time and Splittable Task.	GLOBECOM	2022	DBLP DOI BibTeX RDF
22	Antonia Adamik, Leon Sering	Atomic Splittable Flow Over Time Games.	SAND	2022	DBLP DOI BibTeX RDF
22	Guy L. Steele Jr., Sebastiano Vigna	LXM: better splittable pseudorandom number generators (and almost as fast).	Proc. ACM Program. Lang.	2021	DBLP DOI BibTeX RDF
22	Hadi Kharaghani, Thomas Pender, Sho Suda	Balancedly splittable orthogonal designs and equiangular tight frames.	Des. Codes Cryptogr.	2021	DBLP DOI BibTeX RDF
22	Radu Curticapean, Holger Dell, Thore Husfeldt	Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths.	CoRR	2021	DBLP BibTeX RDF
22	Sami Dallali, Clara Fontaine, Eitan Altman	Splittable Routing Games in Ring Topology with Losses.	EPEW	2021	DBLP DOI BibTeX RDF
22	Yuanliang Gao, Sheung-Hung Poon	A Genetic Algorithm for Scheduling Splittable Tasks with Precedence Constraints.	CEC	2021	DBLP DOI BibTeX RDF
22	Radu Curticapean, Holger Dell, Thore Husfeldt	Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths.	ESA	2021	DBLP DOI BibTeX RDF
22	Pierre L'Ecuyer, Olivier Nadeau-Chamard, Yi-Fan Chen, Justin Lebar	Multiple Streams with Recurrence-Based, Counter-Based, and Splittable Random Number Generators.	WSC	2021	DBLP DOI BibTeX RDF
22	Joo Chan Lee, Yongwoo Kim, Sungtae Moon, Jong Hwan Ko	A Splittable DNN-Based Object Detector for Edge-Cloud Collaborative Real-Time Video Inference.	AVSS	2021	DBLP DOI BibTeX RDF
22	Fernando Granha Jeronimo, Shashank Srivastava, Madhur Tulsiani	Near-linear time decoding of Ta-Shma's codes via splittable regularity.	STOC	2021	DBLP DOI BibTeX RDF
22	Zening Liu, Yang Yang 0001, Kunlun Wang 0001, Ziyu Shao, Junshan Zhang	POST: Parallel Offloading of Splittable Tasks in Heterogeneous Fog Networks.	IEEE Internet Things J.	2020	DBLP DOI BibTeX RDF
22	Peter Damaschke	Dividing Splittable Goods Evenly and With Limited Fragmentation.	Algorithmica	2020	DBLP DOI BibTeX RDF
22	Antonia Adamik, Leon Sering	Atomic Splittable Flow Over Time Games.	CoRR	2020	DBLP BibTeX RDF
22	Anna Melchiori, Antonino Sgalambro	A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem.	Eur. J. Oper. Res.	2020	DBLP DOI BibTeX RDF
22	Max Klimm, Philipp Warode	Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians.	SODA	2020	DBLP DOI BibTeX RDF
22	Hadi Kharaghani, Sho Suda	Balancedly splittable Hadamard matrices.	Discret. Math.	2019	DBLP DOI BibTeX RDF
22	Nino Basic, Jan Groselj, Branko Grünbaum, Tomaz Pisanski	Splittable and unsplittable graphs and configurations.	Ars Math. Contemp.	2019	DBLP DOI BibTeX RDF
22	Tobias Mahn, Hussein Al-Shatri, Anja Klein 0002	Distributed Algorithm for Energy Efficient Joint Cloud and Edge Computing with Splittable Tasks.	WCNC	2019	DBLP DOI BibTeX RDF
22	Michael Yu. Khachay, Yuri Ogorodnikov	Efficient PTAS for the Euclidean Capacitated Vehicle Routing Problem with Non-uniform Non-splittable Demand.	AIST	2019	DBLP DOI BibTeX RDF
22	Andrea Aler Tubella, Alessio Guglielmi	Subatomic Proof Systems: Splittable Systems.	ACM Trans. Comput. Log.	2018	DBLP DOI BibTeX RDF
22	Anna Melchiori, Antonino Sgalambro	A matheuristic approach for the Quickest Multicommodity k-Splittable Flow Problem.	Comput. Oper. Res.	2018	DBLP DOI BibTeX RDF
22	Satsuya Ohata, Takahiro Matsuda 0002, Goichiro Hanaoka, Kanta Matsuura	More Constructions of Re-Splittable Threshold Public Key Encryption.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2018	DBLP DOI BibTeX RDF
22	Umang Bhaskar, Phani Raj Lolakapuri	Equilibrium Computation in Atomic Splittable Routing Games with Convex Cost Functions.	CoRR	2018	DBLP BibTeX RDF
22	Tobias Harks, Veerle Timmermans	Computing Equilibria in Atomic Splittable Polymatroid Congestion Games with Convex Costs.	CoRR	2018	DBLP BibTeX RDF
22	Max Klimm, Philipp Warode	Parametrized Nash Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians.	CoRR	2018	DBLP BibTeX RDF
22	Tobias Harks, Veerle Timmermans	Uniqueness of equilibria in atomic splittable polymatroid congestion games.	J. Comb. Optim.	2018	DBLP DOI BibTeX RDF
22	Klaus-Tycho Foerster	On the Consistent Migration of Splittable Flows: Latency-Awareness and Complexities.	NCA	2018	DBLP DOI BibTeX RDF
22	Georgios S. Paschos, Mohammed Amin Abdullah 0001, Spyridon Vassilaras	Network Slicing with Splittable Flows is Hard.	PIMRC	2018	DBLP DOI BibTeX RDF
22	Umang Bhaskar, Phani Raj Lolakapuri	Equilibrium Computation in Atomic Splittable Routing Games.	ESA	2018	DBLP DOI BibTeX RDF
22	I-Jen Chao, Bin-Da Liu, Soon-Jyh Chang, Chun-Yueh Huang, Hsin-Wen Ting	Analyses of Splittable Amplifier Technique and Cancellation of Memory Effect for Opamp Sharing.	IEEE Trans. Very Large Scale Integr. Syst.	2017	DBLP DOI BibTeX RDF
22	Andrea Aler Tubella, Alessio Guglielmi	Subatomic Proof Systems: Splittable Systems.	CoRR	2017	DBLP BibTeX RDF
22	Pawel Bialon	A randomized rounding approach to a k-splittable multicommodity flow problem with lower path flow bounds affording solution quality guarantees.	Telecommun. Syst.	2017	DBLP DOI BibTeX RDF
22	Tobias Harks, Veerle Timmermans	Equilibrium Computation in Atomic Splittable Singleton Congestion Games.	IPCO	2017	DBLP DOI BibTeX RDF
22	Peter Damaschke	Dividing Splittable Goods Evenly and With Limited Fragmentation.	MFCS	2017	DBLP DOI BibTeX RDF
22	Veerle Timmermans, Tobias Harks	Equilibrium Computation in Atomic Splittable Singleton Congestion Games.	CoRR	2016	DBLP BibTeX RDF
22	Ehab Morsy	Approximating the k-splittable capacitated network design problem.	Discret. Optim.	2016	DBLP DOI BibTeX RDF
22	Ozgur Kabadurmus, Alice E. Smith	Multi-commodity k-splittable survivable network design problems with relays.	Telecommun. Syst.	2016	DBLP DOI BibTeX RDF
22	Tobias Harks, Veerle Timmermans	Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games.	ISCO	2016	DBLP DOI BibTeX RDF
22	Tim Roughgarden, Florian Schoppmann	Local smoothness and the price of anarchy in splittable congestion games.	J. Econ. Theory	2015	DBLP DOI BibTeX RDF
22	Chengwen Jiao, Suixiang Gao, Wenguo Yang	Comparing Algorithms for Minimizing Congestion and Cost in the Multi-Commodity k-Splittable Flow.	Comput. Inf. Sci.	2015	DBLP DOI BibTeX RDF
22	Anatoly V. Anisimov, Igor O. Zavadskyi	Variable-length Splittable Codes with Multiple Delimiters.	CoRR	2015	DBLP BibTeX RDF
22	Tobias Harks, Veerle Timmermans	Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games.	CoRR	2015	DBLP BibTeX RDF
22	Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang	On the Uniqueness of Equilibrium in Atomic Splittable Routing Games.	Math. Oper. Res.	2015	DBLP DOI BibTeX RDF
22	José Correa 0001, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Víctor Verdugo, José Verschae	Strong LP formulations for scheduling splittable jobs on unrelated machines.	Math. Program.	2015	DBLP DOI BibTeX RDF
22	Hans Georg Schaathun	Evaluation of splittable pseudo-random generators.	J. Funct. Program.	2015	DBLP DOI BibTeX RDF
22	Haipei Sun, Liusheng Huang, Long Chen 0006, Hongli Xu, Jianxin Wang 0006	A solution of splittable large flow scheduling based on MCMF in software defined network.	WCSP	2015	DBLP DOI BibTeX RDF
22	Mette Gamst	A local search heuristic for the Multi-Commodity $k$ -splittable Maximum Flow Problem.	Optim. Lett.	2014	DBLP DOI BibTeX RDF
22	Tarek Ababsa, Yves Duthen	Splittable Metamorphic Carrier Robots.	ALIFE	2014	DBLP DOI BibTeX RDF
22	José R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Victor Verdugo, José Verschae	Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines.	IPCO	2014	DBLP DOI BibTeX RDF
22	Guy L. Steele Jr., Doug Lea, Christine H. Flood	Fast splittable pseudorandom number generators.	OOPSLA	2014	DBLP DOI BibTeX RDF
22	Chengwen Jiao, Wenguo Yang, Suixiang Gao, Yinben Xia, Mingming Zhu	The k-splittable flow model and a heuristic algorithm for minimizing congestion in the MPLS networks.	ICNC	2014	DBLP DOI BibTeX RDF
22	Satsuya Ohata, Takahiro Matsuda 0002, Goichiro Hanaoka, Kanta Matsuura	More Constructions of Re-splittable Threshold Public Key Encryption.	IWSEC	2014	DBLP DOI BibTeX RDF
22	Po-An Chen, Chi-Jen Lu	Generalized mirror descents in congestion games with splittable flows.	AAMAS	2014	DBLP BibTeX RDF
22	Hande Yaman	The splittable flow arc set with capacity and minimum load constraints.	Oper. Res. Lett.	2013	DBLP DOI BibTeX RDF
22	Elke Eisenschmidt, Utz-Uwe Haus	A polynomial time approximation algorithm for the two-commodity splittable flow problem.	Math. Methods Oper. Res.	2013	DBLP DOI BibTeX RDF
22	Chien-Chung Huang	Collusion in Atomic Splittable Routing Games.	Theory Comput. Syst.	2013	DBLP DOI BibTeX RDF
22	Adrian Kosowski, Przemyslaw Uznanski	Splittable Single Source-Sink Routing on CMP Grids: A Sublinear Number of Paths Suffice.	Euro-Par	2013	DBLP DOI BibTeX RDF
22	Christopher Auer, Franz J. Brandenburg, Andreas Gleißner, Kathrin Hanauer	Characterizing Planarity by the Splittable Deque.	GD	2013	DBLP DOI BibTeX RDF
22	Koen Claessen, Michal H. Palka	Splittable pseudorandom number generators using cryptographic hashing.	Haskell	2013	DBLP DOI BibTeX RDF
22	Ehab Morsy	Approximating the k-Splittable Capacitated Network Design Problem.	SOFSEM	2013	DBLP DOI BibTeX RDF
22	Leah Epstein, Asaf Levin, Rob van Stee	Approximation Schemes for Packing Splittable Items with Cardinality Constraints.	Algorithmica	2012	DBLP DOI BibTeX RDF
22	Mette Gamst, B. Petersen	Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem.	Eur. J. Oper. Res.	2012	DBLP DOI BibTeX RDF