Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
16 | Holger Dell, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Tobias Mömke |
Complexity and Approximability of Parameterized MAX-CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, September 16-18, 2015, Patras, Greece, pp. 294-306, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-92-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
16 | Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner 0001 |
Approximability results for the resource-constrained project scheduling problem with a single type of resources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 213(1), pp. 115-130, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Nhan-Tam Nguyen, Trung Thanh Nguyen 0004, Magnus Roos, Jörg Rothe |
Computational complexity and approximability of social welfare optimization in multiagent resource allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Auton. Agents Multi Agent Syst. ![In: Auton. Agents Multi Agent Syst. 28(2), pp. 256-289, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Mikael Gast, Mathias Hauptmann |
Approximability of the vertex cover problem in power-law graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 516, pp. 60-70, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Zhixiang Chen 0001, Bin Fu, Randy Goebel, Guohui Lin, Weitian Tong, Jinhui Xu 0001, Boting Yang, Zhiyu Zhao, Binhai Zhu |
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 550, pp. 59-65, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Martin Olsen, Anastasios Viglas |
On the approximability of the link building problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 518, pp. 96-116, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Edouard Bonnet, Vangelis Th. Paschos |
Parameterized (in)approximability of subset problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 42(3), pp. 222-225, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora |
Parameterized approximability of maximizing the spread of influence in networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 27, pp. 54-65, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Bhaskar DasGupta, Nasim Mobasheri |
On optimal approximability results for computing the strong metric dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1408.1390, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
16 | Miikka Hilke, Christoph Lenzen 0001, Jukka Suomela |
Local Approximability of Minimum Dominating Set on Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1402.2549, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
16 | Adam Kasperski, Adam Kurpisz, Pawel Zielinski 0001 |
Approximability of the robust representatives selection problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1405.5381, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
16 | Rafail Ostrovsky, Will Rosenbaum |
It's Not Easy Being Three: The Approximability of Three-Dimensional Stable Matching Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1412.1130, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
16 | Ágnes Cseh, David F. Manlove |
Stable marriage and roommates problems with restricted edges: complexity and approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1412.0271, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
16 | Xujin Chen, Xiaodong Hu 0001, Changjun Wang |
Approximability of the Minimum Weighted Doubly Resolving Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1404.4676, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
16 | Neil Olver, F. Bruce Shepherd |
Approximability of Robust Network Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 39(2), pp. 561-572, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Stefanie Kosuch |
Approximability of the two-stage stochastic knapsack problem with discretely distributed weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 165, pp. 192-204, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Frank Gurski, Magnus Roos |
Binary linear programming solutions and non-approximability for control problems in voting systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 162, pp. 391-398, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Sergio Bermudo, Henning Fernau |
Computing the differential of a graph: Hardness, approximability and exact algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 165, pp. 69-82, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | André Berger, Alexander Grigoriev, Ruben van der Zwaan |
Complexity and approximability of the k-way vertex cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 63(2), pp. 170-178, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Takehiro Ito, Erik D. Demaine |
Approximability of the subset sum reconfiguration problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 28(3), pp. 639-654, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Thang N. Dinh, Yilin Shen, Dung T. Nguyen 0002, My T. Thai |
On the approximability of positive influence dominating set in social networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 27(3), pp. 487-503, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | William Cruz-Santos, Guillermo Morales-Luna |
Approximability of Optimization Problems through Adiabatic Quantum Computation ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2014 |
DOI RDF |
|
16 | Parinya Chalermsook, Sandy Heydrich, Eugenia Holm, Andreas Karrenbauer |
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings, pp. 235-246, 2014, Springer, 978-3-662-44776-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Miikka Hilke, Christoph Lenzen 0001, Jukka Suomela |
Brief announcement: local approximability of minimum dominating set on planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: ACM Symposium on Principles of Distributed Computing, PODC '14, Paris, France, July 15-18, 2014, pp. 344-346, 2014, ACM, 978-1-4503-2944-6. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann |
New Approximability Results for the Robust k-Median Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings, pp. 50-61, 2014, Springer, 978-3-319-08403-9. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Stefano Beretta 0001, Riccardo Dondi |
Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Language, Life, Limits - 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings, pp. 42-52, 2014, Springer, 978-3-319-08018-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Kazuya Haraguchi, Hirotaka Ono 0001 |
Approximability of Latin Square Completion-Type Puzzles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FUN ![In: Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings, pp. 218-229, 2014, Springer, 978-3-319-07889-2. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Xujin Chen, Changjun Wang |
Approximability of the Minimum Weighted Doubly Resolving Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings, pp. 357-368, 2014, Springer, 978-3-319-08782-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
16 | Adrian Bock, Laura Sanità |
On the approximability of two capacitated vehicle routing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 41, pp. 519-526, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Valentin E. Brimkov |
Approximability issues of guarding a set of segments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Math. ![In: Int. J. Comput. Math. 90(8), pp. 1653-1667, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Attila Benko, György Dósa, Zsolt Tuza |
Bin covering with a general profit function: approximability results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Central Eur. J. Oper. Res. ![In: Central Eur. J. Oper. Res. 21(4), pp. 805-816, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Trung Thanh Nguyen 0004, Magnus Roos, Jörg Rothe |
A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 68(1-3), pp. 65-90, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Vladimir G. Deineko, Gerhard J. Woeginger |
Complexity and in-approximability of a selection problem in robust optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 11(3), pp. 249-252, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Riccardo Dondi, Giancarlo Mauri, Italo Zoppis |
The l-Diversity problem: Tractability and approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 511, pp. 159-171, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Dimitris Bertsimas, Vineet Goyal |
On the approximability of adjustable robust convex optimization under uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Methods Oper. Res. ![In: Math. Methods Oper. Res. 77(3), pp. 323-343, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Mathias Hauptmann |
On the approximability of Dense Steiner Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 21, pp. 41-51, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Adrian Dumitrescu, Minghui Jiang 0001 |
On the approximability of covering points by lines and related problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1312.2549, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
16 | Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul 0001 |
Approximability of Connected Factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1310.2387, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
16 | Edouard Bonnet, Vangelis Th. Paschos |
Parameterized (in)approximability of subset problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1310.5576, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
16 | Piotr Skowron 0001, Piotr Faliszewski, Arkadii M. Slinko |
Achieving Fully Proportional Representation: Approximability Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1312.4026, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
16 | Christian Knauer, Stefan König 0003, Daniel Werner |
Fixed Parameter Complexity and Approximability of Norm Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1307.6414, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
16 | Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora |
Parameterized Approximability of Maximizing the Spread of Influence in Networks ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1303.6907, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
16 | Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann |
New Approximability Results for the Robust k-Median Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1309.4602, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
16 | Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono 0001 |
Optimal approximability of bookmark assignments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 161(16-17), pp. 2361-2366, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro |
On the approximability and exact algorithms for vector domination and related problems in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 161(6), pp. 750-767, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Imed Kacem, Vangelis Th. Paschos |
Weighted completion time minimization on a single-machine with a fixed non-availability interval: Differential approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 10(1), pp. 61-68, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Paola Bonizzoni, Riccardo Dondi, Yuri Pirola |
Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 6(1), pp. 1-11, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Clemens Thielen, Stephan Westphal |
Complexity and approximability of the maximum flow problem with minimum quantities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 62(2), pp. 125-131, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Dima Blokh, Danny Segev, Roded Sharan |
The Approximability of Shortest Path-Based Graph Orientations of Protein-Protein Interaction Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Biol. ![In: J. Comput. Biol. 20(12), pp. 945-957, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Jan Vondrák |
Symmetry and Approximability of Submodular Maximization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 42(1), pp. 265-304, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Alberto Caprara, Margarida Carvalho, Andrea Lodi 0001, Gerhard J. Woeginger |
A Complexity and Approximability Study of the Bilevel Knapsack Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Valparaíso, Chile, March 18-20, 2013. Proceedings, pp. 98-109, 2013, Springer, 978-3-642-36693-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Klaus Jansen, Lars Prädel |
New Approximability Results for Two-Dimensional Bin Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pp. 919-936, 2013, SIAM, 978-1-61197-251-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Ryan O'Donnell, Yuan Zhou 0007 |
Approximability and proof complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pp. 1537-1556, 2013, SIAM, 978-1-61197-251-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Alina Ene, Jan Vondrák, Yi Wu 0002 |
Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pp. 306-325, 2013, SIAM, 978-1-61197-251-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Tarek Richard Besold, Robert Robere |
When Almost Is Not Even Close: Remarks on the Approximability of HDTP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AGI ![In: Artificial General Intelligence - 6th International Conference, AGI 2013, Beijing, China, July 31 - August 3, 2013 Proceedings, pp. 11-20, 2013, Springer, 978-3-642-39520-8. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul 0001 |
Approximability of Connected Factors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms - 11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, pp. 120-131, 2013, Springer, 978-3-319-08000-0. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Hans-Joachim Böckenhauer, Lucia Keller |
On the Approximability of Splitting-SAT in 2-CNF Horn Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, pp. 54-66, 2013, Springer, 978-3-642-45277-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Anupam Gupta 0001, Satyen Kale, Viswanath Nagarajan, Rishi Saket, Baruch Schieber |
The Approximability of the Binary Paintshop Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings, pp. 205-217, 2013, Springer, 978-3-642-40327-9. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Cristina Bazgan, Morgan Chopin, André Nichterlein, Florian Sikora |
Parameterized Approximability of Maximizing the Spread of Influence in Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings, pp. 543-554, 2013, Springer, 978-3-642-38767-8. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
16 | Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko |
Fully Proportional Representation as Resource Allocation: Approximability Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013, pp. 353-359, 2013, IJCAI/AAAI, 978-1-57735-633-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
16 | Richard Schmied |
On Approximability of Bounded Degree Instances of Selected Optimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2013 |
RDF |
|
16 | Mikael Gast |
Approximability of Combinatorial Optimization Problems on Power Law Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2013 |
RDF |
|
16 | Johan Håstad, Andrei A. Krokhin, Dániel Marx |
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 12451). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Dagstuhl Reports ![In: Dagstuhl Reports 2(11), pp. 1-19, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Markus Bläser, Holger Dell, Mahmoud Fouz |
Complexity and Approximability of the Cover Polynomial. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 21(3), pp. 359-419, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Venkatesan Guruswami, Yuan Zhou 0007 |
Tight Bounds on the Approximability of Almost-Satisfiable Horn SAT and Exact Hitting Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. ![In: Theory Comput. 8(1), pp. 239-267, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Steven Kelk, Leo van Iersel, Nela Lekic, Simone Linz, Céline Scornavacca, Leen Stougie |
Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 26(4), pp. 1635-1656, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Ioannis Caragiannis, Jason A. Covey, Michal Feldman, Christopher M. Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, Jeffrey S. Rosenschein |
On the approximability of Dodgson and Young elections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 187, pp. 31-51, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy |
Approximability of the Firefighter Problem - Computing Cuts over Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 62(1-2), pp. 520-536, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono 0001, Monika Steinová, Koichi Wada 0001 |
On the approximability and hardness of minimum topic connected overlay and its special instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 429, pp. 144-154, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Laurent Bulteau, Guillaume Fertin, Minghui Jiang 0001, Irena Rusu |
Tractability and approximability of maximal strip recovery. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 440-441, pp. 14-28, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Minghui Jiang 0001 |
Approximability of constrained LCS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 78(3), pp. 689-697, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Mikael Gast, Mathias Hauptmann |
Approximability of the Vertex Cover Problem in Power Law Graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1204.0982, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
16 | Piotr Krzysztof Skowron, Piotr Faliszewski, Arkadii M. Slinko |
Proportional Representation as Resource Allocation: Approximability Results ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1208.1661, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
16 | Ryan O'Donnell, Yuan Zhou 0007 |
Approximability and proof complexity ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1211.1958, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
16 | Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh 0001 |
On the approximability of some degree-constrained subgraph problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 160(12), pp. 1661-1679, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Kazuo Iwama |
Approximability of Stable Matching Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation - 6th International Workshop, WALCOM 2012, Dhaka, Bangladesh, February 15-17, 2012. Proceedings, pp. 2, 2012, Springer, 978-3-642-28075-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Nhan-Tam Nguyen, Trung Thanh Nguyen 0004, Magnus Roos, Jörg Rothe |
Complexity and approximability of social welfare optimization in multiagent resource allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2012, Valencia, Spain, June 4-8, 2012 (3 Volumes), pp. 1287-1288, 2012, IFAAMAS. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
16 | Vadim Azhmyakov, Félix A. Miranda-Villatoro |
Approximability and Variational Description of the Zeno Behavior in Affine Switched Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADHS ![In: 4th IFAC Conference on Analysis and Design of Hybrid Systems, ADHS 2012, Eindhoven, The Netherlands, June 6-8, 2012, pp. 307-312, 2012, Elsevier. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Nhan-Tam Nguyen, Trung Thanh Nguyen 0004, Jörg Rothe |
Complexity and Approximability of Egalitarian Nash Product Social Welfare Optimization in Multiagent Resource Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STAIRS ![In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, Montpellier, France, 27-28 August 2012, pp. 204-215, 2012, IOS Press, 978-1-61499-095-6. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Shalev Ben-David, Elyot Grant, Will Ma, Malcolm Sharpe |
The Approximability and Integrality Gap of Interval Stabbing and Independence Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCCG ![In: Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012, pp. 47-52, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
16 | Mourad El Ouali, Gerold Jäger |
The b-Matching Problem in Hypergraphs: Hardness and Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications - 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings, pp. 200-211, 2012, Springer, 978-3-642-31769-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Trung Thanh Nguyen 0004, Magnus Roos, Jörg Rothe |
A Survey of Approximability and Inapproximability Results for Social Welfare Optimization in Multiagent Resource Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAIM ![In: International Symposium on Artificial Intelligence and Mathematics, ISAIM 2012, Fort Lauderdale, Florida, USA, January 9-11, 2012, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
16 | Zhixiang Chen 0001, Bin Fu, Binhai Zhu |
Erratum: The Approximability of the Exemplar Breakpoint Distance Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW-AAIM ![In: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings, pp. 368, 2012, Springer, 978-3-642-29699-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos, Mingyu Xiao 0001 |
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: Parameterized and Exact Computation - 7th International Symposium, IPEC 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings, pp. 25-36, 2012, Springer, 978-3-642-33292-0. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Monika Steinová |
Measuring hardness of complex problems: Approximability and exact algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2012 |
RDF |
|
16 | Michael Elberfeld, Vineet Bafna, Iftah Gamzu, Alexander Medvedovsky, Danny Segev, Dana Silverbush, Uri Zwick, Roded Sharan |
On the Approximability of Reachability-Preserving Network Orientations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Internet Math. ![In: Internet Math. 7(4), pp. 209-232, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Vadim Azhmyakov, Marco Tulio Angulo |
Applications of the strong approximability property to a class of affine switched systems and to relaxed differential equations with affine structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Syst. Sci. ![In: Int. J. Syst. Sci. 42(11), pp. 1899-1907, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Zachary Friggstad, Mohammad R. Salavatipour |
Approximability of Packing Disjoint Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 60(2), pp. 395-400, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | David Pritchard, Deeparnab Chakrabarty |
Approximability of Sparse Integer Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 61(1), pp. 75-93, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Adam Kasperski, Pawel Zielinski 0001 |
On the approximability of robust spanning tree problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(4-5), pp. 365-374, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Valentin E. Brimkov, Andrew Leach, Jimmy Wu, Michael Mastroianni |
On the Approximability of a Geometric Set Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR11, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
16 | Marcel R. Ackermann, Johannes Blömer, Christoph Scholz 0001 |
Hardness and Non-Approximability of Bregman Clustering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR11, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
16 | Patrik Floréen, Marja Hassinen, Joel Kaasinen, Petteri Kaski, Topi Musto, Jukka Suomela |
Local Approximability of Max-Min and Min-Max Linear Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 49(4), pp. 672-697, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Steven Kelk, Leo van Iersel, Nela Lekic, Simone Linz, Céline Scornavacca, Leen Stougie |
Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1112.5359, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
16 | Tomoyuki Yamakami |
Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1109.3651, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
16 | Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono 0001, Monika Steinová, Koichi Wada 0001 |
On the Approximability and Hardness of Minimum Topic Connected Overlay and Its Special Instances ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1107.2443, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
16 | N. S. Narayanaswamy, Swapnoneel Roy |
On Approximability of Block Sorting ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1110.0892, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
16 | Jan Vondrák |
Symmetry and approximability of submodular maximization problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1110.4860, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
16 | Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson |
On the Approximability of Single-Machine Scheduling with Precedence Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 36(4), pp. 653-669, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Giulia Galbiati, Romeo Rizzi, Edoardo Amaldi |
On the approximability of the minimum strictly fundamental cycle basis problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 159(4), pp. 187-200, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|