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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(1), pp. 162-186, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 122-127, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 612-623, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 238-248, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
50 | Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten |
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 717-728, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 106(3), pp. 453-466, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 389-398, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Approximating Min-Max (Regret) Versions of Some Polynomial Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, pp. 428-438, 2006, Springer, 3-540-36925-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 862-873, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 15(1), pp. 201-211, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 40(4), pp. 423-436, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Nir Andelman, Yossi Azar, Motti Sorani |
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings, pp. 69-82, 2005, Springer, 3-540-24998-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 115(2), pp. 273-290, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings, pp. 31-40, 2008, Springer, 978-3-540-92184-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Alexander Hall, Katharina Langkau, Martin Skutella |
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 47(3), pp. 299-321, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | David Gamarnik, Dmitriy Katz |
Correlation decay and deterministic FPTAS for counting list-colorings of a graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 1245-1254, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 743-748, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
36 | Hans Kellerer, Ulrich Pferschy |
Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(1), pp. 5-11, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings, pp. 71-82, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 194-205, 2001, Springer, 3-540-42493-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
28 | Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta |
Locally restorable routing of highly variable traffic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 17(3), pp. 752-763, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 17(2), pp. 117-133, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAGT ![In: Algorithmic Game Theory, Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009. Proceedings, pp. 196-207, 2009, Springer, 978-3-642-04644-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Yumei Huo, Joseph Y.-T. Leung, Xin Wang |
Integrated Production and Delivery Scheduling with Disjoint Windows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 471-482, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 411-420, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, pp. 114-126, 2008, Springer, 978-3-540-69900-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Abhimanyu Das, David Kempe 0001 |
Algorithms for subset selection in linear regression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 45-54, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 179-192, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Leah Epstein, Rob van Stee |
Maximizing the Minimum Load for Selfish Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 264-275, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Sushu Zhang, Karam S. Chatha |
Approximation algorithm for the temperature-aware scheduling problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2007 International Conference on Computer-Aided Design, ICCAD 2007, San Jose, CA, USA, November 5-8, 2007, pp. 281-288, 2007, IEEE Computer Society, 1-4244-1382-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Mikhail Y. Kovalyov, Marie-Claude Portmann, Ammar Oulamara |
Optimal testing and repairing a failed series system. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 12(3), pp. 279-295, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 494-506, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Takehiro Ito, Erik D. Demaine, Xiao Zhou 0001, Takao Nishizeki |
Approximability of Partitioning Graphs with Supply and Demand. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 121-130, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta |
Throughput Guaranteed Restorable Routing Without Traffic Prediction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNP ![In: Proceedings of the 14th IEEE International Conference on Network Protocols, ICNP 2006, November 12-15, 2006, Santa Barbara, California, USA, pp. 137-146, 2006, IEEE Computer Society, 1-4244-0593-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Erik Jan van Leeuwen |
Better Approximation Schemes for Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings, pp. 316-327, 2006, Springer, 3-540-35753-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 675-684, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Rongjie Yan, Guangyuan Li, Zhisong Tang |
Symbolic Model Checking of Finite Precision Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAC ![In: Theoretical Aspects of Computing - ICTAC 2005, Second International Colloquium, Hanoi, Vietnam, October 17-21, 2005, Proceedings, pp. 272-287, 2005, Springer, 3-540-29107-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Finite precision timed automata, model checking, symbolic methods |
28 | Erik Jan van Leeuwen |
Approximation Algorithms for Unit Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 351-361, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Patrick Briest, Piotr Krysta, Berthold Vöcking |
Approximation techniques for utilitarian mechanism design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 39-48, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings, pp. 176-186, 2004, Springer, 3-540-21236-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Naveen Garg 0001, Rohit Khandekar |
Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 500-, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
22 | Ilan Doron Arad, Ariel Kulik, Hadas Shachnai |
An FPTAS for budgeted laminar matroid independent set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 51(6), pp. 632-637, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Bo Chen 0002, Vitaly A. Strusevich |
An FPTAS for scheduling with resource constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 51(4), pp. 421-424, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Yiannis Giannakopoulos |
A Smoothed FPTAS for Equilibria in Congestion Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.10600, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Ilan Doron Arad, Ariel Kulik, Hadas Shachnai |
An FPTAS for Budgeted Laminar Matroid Independent Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.13984, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Lin Chen 0009, Jiayi Lian, Yuchen Mao, Guochuan Zhang |
A Nearly Quadratic-Time FPTAS for Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.07821, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 16(4), pp. 1181-1196, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 929, pp. 174-190, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.08704, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
22 | Bar Mahpud, Or Sheffet |
A Differentially Private Linear-Time fPTAS for the Minimum Enclosing Ball Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.03319, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Wenxin Li 0004, Joohyun Lee, Ness B. Shroff |
A faster FPTAS for knapsack problem with cardinality constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 315, pp. 71-85, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2022: Parallel Processing - 28th International Conference on Parallel and Distributed Computing, Glasgow, UK, August 22-26, 2022, Proceedings, pp. 136-151, 2022, Springer, 978-3-031-12596-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Bar Mahpud, Or Sheffet |
A Differentially Private Linear-Time fPTAS for the Minimum Enclosing Ball Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022., 2022, 9781713871088. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Oper. Res. ![In: RAIRO Oper. Res. 55(Supplement), pp. S727-S740, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Adil I. Erzin, Natalya Lagutkina |
FPTAS for barrier covering problem with equal touching circles in 2D. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 15(4), pp. 1397-1406, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Dmitry V. Gribanov |
An FPTAS for the Δ-modular multidimensional knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.07257, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
22 | Tzvi Alon, Nir Halman |
A faster FPTAS for counting two-rowed contingency tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 303, pp. 161-170, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 14(2), pp. 43, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pp. 1520-1534, 2021, SIAM, 978-1-61197-646-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Dmitriy V. Gribanov |
An FPTAS for the Δ-Modular Multidimensional Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MOTOR ![In: Mathematical Optimization Theory and Operations Research - 20th International Conference, MOTOR 2021, Irkutsk, Russia, July 5-10, 2021, Proceedings, pp. 79-95, 2021, Springer, 978-3-030-77875-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management - 15th International Conference, AAIM 2021, Virtual Event, December 20-22, 2021, Proceedings, pp. 265-276, 2021, Springer, 978-3-030-93175-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 833, pp. 87-106, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Ziyu Shen, Jinshui Zhang, Haisheng Tan |
A Truthful FPTAS Auction for the Edge-Cloud Pricing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BigCom ![In: 6th International Conference on Big Data Computing and Communications, BIGCOM 2020, Deqing, China, July 24-25, 2020, pp. 140-144, 2020, IEEE, 978-1-7281-8275-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Wenxin Li 0004, Joohyun Lee, Ness B. Shroff |
A Faster FPTAS for Knapsack Problem with Cardinality Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers, pp. 16-29, 2020, Springer, 978-3-030-80878-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Optim. ![In: SIAM J. Optim. 29(2), pp. 1131-1163, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.02978, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
22 | Ce Jin 0001 |
An Improved FPTAS for 0-1 Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.09562, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
22 | Zhihao Jiang, Haoyu Zhao |
An FPTAS for Stochastic Unbounded Min-Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.00547, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
22 | Wenxin Li 0004, Joohyun Lee, Ness B. Shroff |
A Faster FPTAS for Knapsack Problem With Cardinality Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.00919, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
22 | Ce Jin 0001 |
An Improved FPTAS for 0-1 Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece., pp. 76:1-76:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-109-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Zhihao Jiang, Haoyu Zhao |
An FPTAS for Stochastic Unbounded Min-Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics - 13th International Workshop, FAW 2019, Sanya, China, April 29 - May 3, 2019, Proceedings, pp. 121-132, 2019, Springer, 978-3-030-18125-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM ![In: 2019 IEEE Conference on Computer Communications, INFOCOM 2019, Paris, France, April 29 - May 2, 2019, pp. 2557-2565, 2019, IEEE, 978-1-7281-0515-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings, pp. 25-37, 2019, Springer, 978-3-030-26175-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Klaus Jansen, Stefan Erich Julius Kraft |
A faster FPTAS for the Unbounded Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 68, pp. 148-174, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Nir Halman, Michael Holzhauser, Sven O. Krumke |
An FPTAS for the knapsack problem with parametric weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 46(5), pp. 487-491, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Pawel Gawrychowski, Liran Markin, Oren Weimann |
A Faster FPTAS for #Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1802.05791, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
22 | Nikolaos Melissinos, Aris Pagourtzis |
A Faster FPTAS for the Subset-Sums Ratio Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1803.09952, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
22 | Adil I. Erzin, Natalya Lagutkina |
FPTAS for barrier covering problem with equal circles in 2D. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1811.10161, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1811.11680, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
22 | Galia Shabtai, Danny Raz, Yuval Shavitt |
A Relaxed FPTAS for Chance-Constrained Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 72:1-72:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Pawel Gawrychowski, Liran Markin, Oren Weimann |
A Faster FPTAS for #Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, pp. 64:1-64:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-076-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Christian Knauer, Luise Sommer, Fabian Stehn |
An FPTAS for an Elastic Shape Matching Problem with Cyclic Neighborhoods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (2) ![In: Computational Science and Its Applications - ICCSA 2018 - 18th International Conference, Melbourne, VIC, Australia, July 2-5, 2018, Proceedings, Part II, pp. 425-443, 2018, Springer, 978-3-319-95164-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Nikolaos Melissinos, Aris Pagourtzis |
A Faster FPTAS for the Subset-Sums Ratio Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings, pp. 602-614, 2018, Springer, 978-3-319-94775-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Hau Chan, Albert Xin Jiang |
An FPTAS for Computing Nash Equilibrium in Resource Graph Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, Stockholm, Sweden., pp. 152-158, 2018, ijcai.org, 978-0-9992411-2-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Michael Holzhauser, Sven O. Krumke |
An FPTAS for the parametric knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 126, pp. 43-47, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 78(3), pp. 741-770, 2017. The full citation details ...](Pics/full.jpeg) |
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]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 687, pp. 93-94, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 657, pp. 64-72, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Michael Holzhauser, Sven Oliver Krumke |
An FPTAS for the Knapsack Problem with Parametric Weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1703.06048, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1710.10904, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
22 | Michael Holzhauser, Sven O. Krumke |
An FPTAS for the parametric knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1701.07822, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 256(1), pp. 55-61, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Wei Ding 0006, Ke Qiu 0001 |
An FPTAS for generalized absolute 1-center problem in vertex-weighted graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 34(4), pp. 1084-1095, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand, pp. 19:1-19:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-054-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pp. 1798-1817, 2017, SIAM, 978-1-61197-478-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017, Proceedings., pp. 421-432, 2017, Springer, 978-3-319-53924-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings, pp. 13-24, 2017, Springer, 978-3-319-62388-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Asia Pac. J. Oper. Res. ![In: Asia Pac. J. Oper. Res. 33(5), pp. 1650039:1-1650039:11, 2016. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 76(4), pp. 1245-1263, 2016. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1607.07950, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|