Search results for "FPTAS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
92	George Tsaggouris, Christos D. Zaroliagis	Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Multiobjective shortes path, Non-linear objectives, Multiple constrained (optimal) path, Non-additive shortest path, Qos-aware multicommodity flow, Multiobjective optimization, FPTAS
56	Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, Chandra Nair, Prasad Tetali	Simple deterministic approximation algorithms for counting matchings.	STOC	2007	DBLP DOI BibTeX RDF	correlation decay, matching, partition function, FPTAS
56	Takehiro Ito, Xiao Zhou 0001, Takao Nishizeki	Partitioning Trees of Supply and Demand.	ISAAC	2002	DBLP DOI BibTeX RDF	maximum partition problem, supply, algorithm, approximation, tree, demand, partition problem, FPTAS
50	George Karakostas, Stavros G. Kolliopoulos, Jing Wang	An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates.	COCOON	2009	DBLP DOI BibTeX RDF
50	Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten	A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem.	ESA	2007	DBLP DOI BibTeX RDF	Multi-objective knapsack problem, dynamic programming, combinatorial optimization, approximation, dominance relations
50	Sergei Chubanov, Mikhail Y. Kovalyov, Erwin Pesch	An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure.	Math. Program.	2006	DBLP DOI BibTeX RDF	Capacitated economic lot-sizing problem, Dynamic programming, Fully polynomial time approximation scheme
50	George Tsaggouris, Christos D. Zaroliagis	Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications.	ISAAC	2006	DBLP DOI BibTeX RDF
42	Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten	Approximating Min-Max (Regret) Versions of Some Polynomial Problems.	COCOON	2006	DBLP DOI BibTeX RDF	min-max regret, approximation, shortest path, minimum spanning tree, min-max, fptas
42	Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten	Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack.	ESA	2005	DBLP DOI BibTeX RDF	min-max regret, mi-nimum spanning tree, approximation, shortest path, knapsack, min-max, fptas
42	Guoliang Xue, Arunabha Sen, Weiyi Zhang 0001, Jian Tang 0008, Krishnaiyan Thulasiraman	Finding a path subject to many additive QoS constraints.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	efficient approximation algorithms, multiple additive constraints, QoS routing
42	Nir Andelman, Yossi Azar, Motti Sorani	Truthful Approximation Mechanisms for Scheduling Selfish Related Machines.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
42	Nir Andelman, Yossi Azar, Motti Sorani	Truthful Approximation Mechanisms for Scheduling Selfish Related Machines.	STACS	2005	DBLP DOI BibTeX RDF
36	Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe, Robert Weismantel	FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension.	Math. Program.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C11, 90C30, 90C57, 90C60
36	Zhisu Zhu, Chuangyin Dang, Yinyu Ye 0001	A FPTAS for Computing a Symmetric Leontief Competitive Economy Equilibrium.	WINE	2008	DBLP DOI BibTeX RDF
36	Alexander Hall, Katharina Langkau, Martin Skutella	An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.	Algorithmica	2007	DBLP DOI BibTeX RDF
36	David Gamarnik, Dmitriy Katz	Correlation decay and deterministic FPTAS for counting list-colorings of a graph.	SODA	2007	DBLP BibTeX RDF
36	Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe, Robert Weismantel	FPTAS for mixed-integer polynomial optimization with a fixed number of variables.	SODA	2006	DBLP DOI BibTeX RDF
36	Hans Kellerer, Ulrich Pferschy	Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	fully polynomial approximation scheme, dynamic programming, knapsack problem
36	Alexander Hall, Katharina Langkau, Martin Skutella	An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
36	Eric Angel, Evripidis Bampis, Alexander V. Kononov	A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs.	ESA	2001	DBLP DOI BibTeX RDF
28	Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta	Locally restorable routing of highly variable traffic.	IEEE/ACM Trans. Netw.	2009	DBLP DOI BibTeX RDF	fast restoration, hose traffic model, link restoration, two-phase routing, valiant load balancing, variable traffic, oblivious routing
28	Imed Kacem	Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Non-availability constraint, Scheduling, Approximation, Makespan
28	Tanmoy Chakraborty 0001, Sanjeev Khanna	Nash Dynamics in Constant Player and Bounded Jump Congestion Games.	SAGT	2009	DBLP DOI BibTeX RDF
28	Yumei Huo, Joseph Y.-T. Leung, Xin Wang	Integrated Production and Delivery Scheduling with Disjoint Windows.	COCOA	2009	DBLP DOI BibTeX RDF	Perishable goods, Parallel and identical machines, NP-hard and strong NP-hard, Fully polynomial time approximation schemes, Single machine
28	Yuzhong Zhang, Jianfeng Ren, Chengfei Wang	Scheduling with Rejection to Minimize the Makespan.	COCOA	2009	DBLP DOI BibTeX RDF	scheduling with rejection, worst case performance ratio, Approximation algorithm, dynamic programming
28	Sándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller	The Maximum Energy-Constrained Dynamic Flow Problem.	SWAT	2008	DBLP DOI BibTeX RDF
28	Abhimanyu Das, David Kempe 0001	Algorithms for subset selection in linear regression.	STOC	2008	DBLP DOI BibTeX RDF	subset selection, sparse approximation
28	Shashi Mittal, Andreas S. Schulz	A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
28	Leah Epstein, Rob van Stee	Maximizing the Minimum Load for Selfish Agents.	LATIN	2008	DBLP DOI BibTeX RDF
28	Sushu Zhang, Karam S. Chatha	Approximation algorithm for the temperature-aware scheduling problem.	ICCAD	2007	DBLP DOI BibTeX RDF
28	Mikhail Y. Kovalyov, Marie-Claude Portmann, Ammar Oulamara	Optimal testing and repairing a failed series system.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Test and repair policies, Pseudo-boolean functions, Optimization, Failure diagnosis, Fully polynomial time approximation scheme
28	Yunhong Zhou	Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems.	ISAAC	2006	DBLP DOI BibTeX RDF
28	Takehiro Ito, Erik D. Demaine, Xiao Zhou 0001, Takao Nishizeki	Approximability of Partitioning Graphs with Supply and Demand.	ISAAC	2006	DBLP DOI BibTeX RDF
28	Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta	Throughput Guaranteed Restorable Routing Without Traffic Prediction.	ICNP	2006	DBLP DOI BibTeX RDF
28	Erik Jan van Leeuwen	Better Approximation Schemes for Disk Graphs.	SWAT	2006	DBLP DOI BibTeX RDF
28	Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking	Decision Making Based on Approximate and Smoothed Pareto Curves.	ISAAC	2005	DBLP DOI BibTeX RDF
28	Rongjie Yan, Guangyuan Li, Zhisong Tang	Symbolic Model Checking of Finite Precision Timed Automata.	ICTAC	2005	DBLP DOI BibTeX RDF	Finite precision timed automata, model checking, symbolic methods
28	Erik Jan van Leeuwen	Approximation Algorithms for Unit Disk Graphs.	WG	2005	DBLP DOI BibTeX RDF
28	Patrick Briest, Piotr Krysta, Berthold Vöcking	Approximation techniques for utilitarian mechanism design.	STOC	2005	DBLP DOI BibTeX RDF	combinatorial and multi-unit auctions, enumeration techniques, approximation algorithms, mechanism design, primal-dual method
28	Stavros G. Kolliopoulos, George Steiner	On Minimizing the Total Weighted Tardiness on a Single Machine.	STACS	2004	DBLP DOI BibTeX RDF
28	Naveen Garg 0001, Rohit Khandekar	Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems.	FOCS	2002	DBLP DOI BibTeX RDF
22	Ilan Doron Arad, Ariel Kulik, Hadas Shachnai	An FPTAS for budgeted laminar matroid independent set.	Oper. Res. Lett.	2023	DBLP DOI BibTeX RDF
22	Bo Chen 0002, Vitaly A. Strusevich	An FPTAS for scheduling with resource constraints.	Oper. Res. Lett.	2023	DBLP DOI BibTeX RDF
22	Yiannis Giannakopoulos	A Smoothed FPTAS for Equilibria in Congestion Games.	CoRR	2023	DBLP DOI BibTeX RDF
22	Ilan Doron Arad, Ariel Kulik, Hadas Shachnai	An FPTAS for Budgeted Laminar Matroid Independent Set.	CoRR	2023	DBLP DOI BibTeX RDF
22	Lin Chen 0009, Jiayi Lian, Yuchen Mao, Guochuan Zhang	A Nearly Quadratic-Time FPTAS for Knapsack.	CoRR	2023	DBLP DOI BibTeX RDF
22	Nir Halman, Uriel Vinetz	An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences.	Optim. Lett.	2022	DBLP DOI BibTeX RDF
22	Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao	An FPTAS for the hardcore model on random regular bipartite graphs.	Theor. Comput. Sci.	2022	DBLP DOI BibTeX RDF
22	Eric Angel, Sébastien Morais, Damien Regnault	A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with Bounded Tree-width.	CoRR	2022	DBLP BibTeX RDF
22	Bar Mahpud, Or Sheffet	A Differentially Private Linear-Time fPTAS for the Minimum Enclosing Ball Problem.	CoRR	2022	DBLP DOI BibTeX RDF
22	Wenxin Li 0004, Joohyun Lee, Ness B. Shroff	A faster FPTAS for knapsack problem with cardinality constraint.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
22	Eric Angel, Sébastien Morais, Damien Regnault	A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width.	Euro-Par	2022	DBLP DOI BibTeX RDF
22	Bar Mahpud, Or Sheffet	A Differentially Private Linear-Time fPTAS for the Minimum Enclosing Ball Problem.	NeurIPS	2022	DBLP BibTeX RDF
22	Amir Elalouf	An FPTAS for just-in-time scheduling of a flow shop manufacturing process with different service quality levels.	RAIRO Oper. Res.	2021	DBLP DOI BibTeX RDF
22	Adil I. Erzin, Natalya Lagutkina	FPTAS for barrier covering problem with equal touching circles in 2D.	Optim. Lett.	2021	DBLP DOI BibTeX RDF
22	Dmitry V. Gribanov	An FPTAS for the Δ-modular multidimensional knapsack problem.	CoRR	2021	DBLP BibTeX RDF
22	Tzvi Alon, Nir Halman	A faster FPTAS for counting two-rowed contingency tables.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
22	Pedro Maristany de las Casas, Ralf Borndörfer, Luitgard Kraus, Antonio Sedeño-Noda	An FPTAS for Dynamic Multiobjective Shortest Path Problems.	Algorithms	2021	DBLP DOI BibTeX RDF
22	Jin-Yi Cai, Tianyu Liu 0002	An FPTAS for the square lattice six-vertex and eight-vertex models at low temperatures.	SODA	2021	DBLP DOI BibTeX RDF
22	Dmitriy V. Gribanov	An FPTAS for the Δ-Modular Multidimensional Knapsack Problem.	MOTOR	2021	DBLP DOI BibTeX RDF
22	Wenjie Zou, Longkun Guo, Chunlin Hao, Lei Liu	A Fast FPTAS for Two Dimensional Barrier Coverage Using Sink-Based Mobile Sensors with MinSum Movement.	AAIM	2021	DBLP DOI BibTeX RDF
22	Ei Ando, Shuji Kijima	An FPTAS for the volume of some V-polytopes - It is hard to compute the volume of the intersection of two cross-polytopes.	Theor. Comput. Sci.	2020	DBLP DOI BibTeX RDF
22	Ziyu Shen, Jinshui Zhang, Haisheng Tan	A Truthful FPTAS Auction for the Edge-Cloud Pricing Problem.	BigCom	2020	DBLP DOI BibTeX RDF
22	Wenxin Li 0004, Joohyun Lee, Ness B. Shroff	A Faster FPTAS for Knapsack Problem with Cardinality Constraint.	WAOA	2020	DBLP DOI BibTeX RDF
22	Nir Halman, Giacomo Nannicini	Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States.	SIAM J. Optim.	2019	DBLP DOI BibTeX RDF
22	Jianhai Chen, Deshi Ye, Shouling Ji, Qinming He, Yang Xiang 0001, Zhenguang Liu	A Truthful FPTAS Mechanism for Emergency Demand Response in Colocation Data Centers.	CoRR	2019	DBLP BibTeX RDF
22	Ce Jin 0001	An Improved FPTAS for 0-1 Knapsack.	CoRR	2019	DBLP BibTeX RDF
22	Zhihao Jiang, Haoyu Zhao	An FPTAS for Stochastic Unbounded Min-Knapsack Problem.	CoRR	2019	DBLP BibTeX RDF
22	Wenxin Li 0004, Joohyun Lee, Ness B. Shroff	A Faster FPTAS for Knapsack Problem With Cardinality Constraint.	CoRR	2019	DBLP BibTeX RDF
22	Ce Jin 0001	An Improved FPTAS for 0-1 Knapsack.	ICALP	2019	DBLP DOI BibTeX RDF
22	Zhihao Jiang, Haoyu Zhao	An FPTAS for Stochastic Unbounded Min-Knapsack Problem.	FAW	2019	DBLP DOI BibTeX RDF
22	Jianhai Chen, Deshi Ye, Shouling Ji, Qinming He, Yang Xiang 0001, Zhenguang Liu	A Truthful FPTAS Mechanism for Emergency Demand Response in Colocation Data Centers.	INFOCOM	2019	DBLP DOI BibTeX RDF
22	Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten	An FPTAS for a General Class of Parametric Optimization Problems.	COCOON	2019	DBLP DOI BibTeX RDF
22	Klaus Jansen, Stefan Erich Julius Kraft	A faster FPTAS for the Unbounded Knapsack Problem.	Eur. J. Comb.	2018	DBLP DOI BibTeX RDF
22	Nir Halman, Michael Holzhauser, Sven O. Krumke	An FPTAS for the knapsack problem with parametric weights.	Oper. Res. Lett.	2018	DBLP DOI BibTeX RDF
22	Pawel Gawrychowski, Liran Markin, Oren Weimann	A Faster FPTAS for #Knapsack.	CoRR	2018	DBLP BibTeX RDF
22	Nikolaos Melissinos, Aris Pagourtzis	A Faster FPTAS for the Subset-Sums Ratio Problem.	CoRR	2018	DBLP BibTeX RDF
22	Adil I. Erzin, Natalya Lagutkina	FPTAS for barrier covering problem with equal circles in 2D.	CoRR	2018	DBLP BibTeX RDF
22	Nir Halman, Giacomo Nannicini	Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional actions and scalar states.	CoRR	2018	DBLP BibTeX RDF
22	Galia Shabtai, Danny Raz, Yuval Shavitt	A Relaxed FPTAS for Chance-Constrained Knapsack.	ISAAC	2018	DBLP DOI BibTeX RDF
22	Pawel Gawrychowski, Liran Markin, Oren Weimann	A Faster FPTAS for #Knapsack.	ICALP	2018	DBLP DOI BibTeX RDF
22	Christian Knauer, Luise Sommer, Fabian Stehn	An FPTAS for an Elastic Shape Matching Problem with Cyclic Neighborhoods.	ICCSA (2)	2018	DBLP DOI BibTeX RDF
22	Nikolaos Melissinos, Aris Pagourtzis	A Faster FPTAS for the Subset-Sums Ratio Problem.	COCOON	2018	DBLP DOI BibTeX RDF
22	Hau Chan, Albert Xin Jiang	An FPTAS for Computing Nash Equilibrium in Resource Graph Games.	IJCAI	2018	DBLP DOI BibTeX RDF
22	Michael Holzhauser, Sven O. Krumke	An FPTAS for the parametric knapsack problem.	Inf. Process. Lett.	2017	DBLP DOI BibTeX RDF
22	Hu Ding, Jinhui Xu 0001	FPTAS for Minimizing the Earth Mover's Distance Under Rigid Transformations and Related Problems.	Algorithmica	2017	DBLP DOI BibTeX RDF
22	Jianming Dong, Jueliang Hu, Mikhail Y. Kovalyov, Guohui Lin, Taibo Luo, Weitian Tong, Xueshi Wang, Yinfeng Xu	Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72].	Theor. Comput. Sci.	2017	DBLP DOI BibTeX RDF
22	Jianming Dong, Weitian Tong, Taibo Luo, Xueshi Wang, Jueliang Hu, Yinfeng Xu, Guohui Lin	An FPTAS for the parallel two-stage flowshop problem.	Theor. Comput. Sci.	2017	DBLP DOI BibTeX RDF
22	Michael Holzhauser, Sven Oliver Krumke	An FPTAS for the Knapsack Problem with Parametric Weights.	CoRR	2017	DBLP BibTeX RDF
22	Gruia Calinescu, Florian Jaehn, Minming Li, Kai Wang 0018	An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint.	CoRR	2017	DBLP BibTeX RDF
22	Michael Holzhauser, Sven O. Krumke	An FPTAS for the parametric knapsack problem.	CoRR	2017	DBLP BibTeX RDF
22	Pierre Baptiste, Djamal Rebaine, Mohammed Zouba	FPTAS for the two identical parallel machine problem with a single operator under the free changing mode.	Eur. J. Oper. Res.	2017	DBLP DOI BibTeX RDF
22	Wei Ding 0006, Ke Qiu 0001	An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs.	J. Comb. Optim.	2017	DBLP DOI BibTeX RDF
22	Gruia Calinescu, Florian Jaehn, Minming Li, Kai Wang 0018	An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint.	ISAAC	2017	DBLP DOI BibTeX RDF
22	Pinyan Lu, Kuan Yang, Chihao Zhang 0001, Minshen Zhu	An FPTAS for Counting Proper Four-Colorings on Cubic Graphs.	SODA	2017	DBLP DOI BibTeX RDF
22	Ei Ando	An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths.	WALCOM	2017	DBLP DOI BibTeX RDF
22	Ei Ando, Shuji Kijima	An FPTAS for the Volume of Some V -polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes.	COCOON	2017	DBLP DOI BibTeX RDF
22	Shang-Chia Liu, Chin-Chia Wu	A Faster FPTAS for a Supply Chain Scheduling Problem to Minimize Holding Costs with Outsourcing.	Asia Pac. J. Oper. Res.	2016	DBLP DOI BibTeX RDF
22	Ei Ando, Shuji Kijima	An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution.	Algorithmica	2016	DBLP DOI BibTeX RDF
22	Cédric Bentz, Pierre Le Bodic	A note on "Approximation schemes for a subclass of subset selection problems", and a faster FPTAS for the Minimum Knapsack Problem.	CoRR	2016	DBLP BibTeX RDF