Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
16 | Sylvain Guillemot |
Parameterized complexity and approximability of the Longest Compatible Sequence problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 8(1), pp. 50-60, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Mohammad Sadeq Dousti, Rasool Jalili |
Milder Definitions of Computational Approximability: The Case of Zero-Knowledge Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2011, pp. 514, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
16 | Sascha Grau, Mathias Fischer 0001, Michael Brinkmeier, Günter Schäfer |
On Complexity and Approximability of Optimal DoS Attacks on Multiple-Tree P2P Streaming Topologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Dependable Secur. Comput. ![In: IEEE Trans. Dependable Secur. Comput. 8(2), pp. 270-281, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Patrick Briest, Piotr Krysta |
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 40(6), pp. 1554-1586, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Tomoyuki Yamakami |
Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings, pp. 454-463, 2011, Springer, 978-3-642-25590-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Stefanie Kosuch |
Approximability of the Two-Stage Knapsack problem with discretely distributed weights. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CTW ![In: Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, June 14-16, 2011, pp. 180-183, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
16 | Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula |
Approximability of Capacitated Network Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, NY, USA, June 15-17, 2011. Proceedings, pp. 78-91, 2011, Springer, 978-3-642-20806-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Ning Chen 0005, Nick Gravin, Pinyan Lu |
On the Approximability of Budget Feasible Mechanisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011, pp. 685-699, 2011, SIAM, 978-0-89871-993-2. The full citation details ...](Pics/full.jpeg) |
2011 |
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) |
SODA ![In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011, pp. 1574-1589, 2011, SIAM, 978-0-89871-993-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Amit Kumar 0001, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi |
On LP-Based Approximability for Strict CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011, pp. 1560-1573, 2011, SIAM, 978-0-89871-993-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Martin Fink 0001, Joachim Spoerhase |
Maximum Betweenness Centrality: Approximability and Tractable Cases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, pp. 9-20, 2011, Springer, 978-3-642-19093-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Spyros C. Kontogiannis, Paul G. Spirakis |
Approximability of Symmetric Bimatrix Games and Related Experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEA ![In: Experimental Algorithms - 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings, pp. 1-20, 2011, Springer, 978-3-642-20661-0. The full citation details ...](Pics/full.jpeg) |
2011 |
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) |
CPM ![In: Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings, pp. 336-349, 2011, Springer, 978-3-642-21457-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Takehiro Ito, Erik D. Demaine |
Approximability of the Subset Sum Reconfiguration Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings, pp. 58-69, 2011, Springer, 978-3-642-20876-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Angsheng Li, Linqing Tang |
The Complexity and Approximability of Minimum Contamination Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings, pp. 298-307, 2011, Springer, 978-3-642-20876-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Valentin E. Brimkov |
Complexity and Approximability Issues in Combinatorial Image Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWCIA ![In: Combinatorial Image Analysis - 14th International Workshop, IWCIA 2011, Madrid, Spain, May 23-25, 2011. Proceedings, pp. 5-8, 2011, Springer, 978-3-642-21072-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Jun Hosoda, Juraj Hromkovic, Taisuke Izumi, Hirotaka Ono 0001, Monika Steinová, Koichi Wada 0001 |
On the Approximability of Minimum Topic Connected Overlay and Its Special Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, pp. 376-387, 2011, Springer, 978-3-642-22992-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono 0001, Yushi Uno, Koichi Yamazaki |
Approximability of the Path-Distance-Width for AT-free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers, pp. 271-282, 2011, Springer, 978-3-642-25869-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Katarína Cechlárová, Eva Jelínková |
Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers, pp. 95-106, 2011, Springer, 978-3-642-25869-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro |
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, pp. 288-297, 2011, Springer, 978-3-642-22952-7. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Sophie Toulouse |
Approximability of the Multiple Stack TSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 36, pp. 813-820, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Dries R. Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger |
The approximability of three-dimensional assignment problems with bottleneck objective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 4(1), pp. 7-16, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Bottleneck problem, Multidimensional assignment, Computational complexity, Approximation, Efficient algorithm |
16 | Liming Cai, Xiuzhen Huang |
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 57(2), pp. 398-412, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Tomoko Izumi, Taisuke Izumi, Hirotaka Ono 0001, Koichi Wada 0001 |
Approximability and inapproximability of the minimum certificate dispersal problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 411(31-33), pp. 2773-2783, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Douglas S. Altner, Özlem Ergun, Nelson A. Uhan |
The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 38(1), pp. 33-38, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
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) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR10, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek |
Hardness and Approximability in Multi-Objective Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR10, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Peter Jonsson, Gustav Nordh |
Approximability of Clausal Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 46(2), pp. 370-395, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei Wang 0010 |
Approximability of combinatorial problems with multi-agent submodular cost functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGecom Exch. ![In: SIGecom Exch. 9(1), pp. 8, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Martin Fink 0001, Joachim Spoerhase |
Maximum Betweenness Centrality: Approximability and Tractable Cases ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1008.3503, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Ning Chen 0005, Nick Gravin, Pinyan Lu |
On the Approximability of Budget Feasible Mechanisms ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1007.3801, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro |
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1012.1529, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Sophie Toulouse |
Approximability of the Multiple Stack TSP ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1009.5030, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula |
Approximability of Capacitated Network Design ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1009.5734, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Adam Kasperski, Pawel Zielinski 0001 |
On the approximability of robust spanning tree problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1004.2891, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Stanislaw Gawiejnowicz, Alexander V. Kononov |
Complexity and approximability of scheduling resumable proportionally deteriorating jobs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 200(1), pp. 305-308, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Deeparnab Chakrabarty, Gagan Goel |
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 39(6), pp. 2189-2211, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Minghui Jiang 0001 |
Approximability of Constrained LCS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC (2) ![In: Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II, pp. 180-191, 2010, Springer, 978-3-642-17513-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman 0001 |
On the Approximability of the Maximum Interval Constrained Coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC (2) ![In: Algorithms and Computation - 21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II, pp. 168-179, 2010, Springer, 978-3-642-17513-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Andreas Bley, Jose Neto |
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings, pp. 205-218, 2010, Springer, 978-3-642-13035-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Neil Olver, F. Bruce Shepherd |
Approximability of Robust Network Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, pp. 1097-1105, 2010, SIAM, 978-0-89871-701-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Raphaël Clifford, Alexandru Popa 0001 |
(In)approximability Results for Pattern Matching Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stringology ![In: Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30 - September 1, 2010, pp. 52-62, 2010, Prague Stringology Club, Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, 978-80-01-04597-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Pai-Han Huang, Yi Gai, Bhaskar Krishnamachari, Ashwin Sridharan |
Subcarrier Allocation in Multiuser OFDM Systems: Complexity and Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WCNC ![In: 2010 IEEE Wireless Communications and Networking Conference, WCNC 2010, Proceedings, Sydney, Australia, 18-21 April 2010, pp. 1-6, 2010, IEEE, 978-1-4244-6398-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek |
Approximability and Hardness in Multi-objective Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Programs, Proofs, Processes, 6th Conference on Computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010. Proceedings, pp. 180-189, 2010, Springer, 978-3-642-13961-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Antonios Antoniadis 0001, Andrzej Lingas |
Approximability of Edge Matching Puzzles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings, pp. 153-164, 2010, Springer, 978-3-642-11265-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Qiaoming Han, Abraham P. Punnen |
On the Approximability of the Vertex Cover and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, 6th International Conference, AAIM 2010, Weihai, China, July 19-21, 2010. Proceedings, pp. 161-169, 2010, Springer, 978-3-642-14354-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Yi Wu 0002 |
The Approximability of Learning and Constraint Satisfaction Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2010 |
DOI RDF |
|
16 | Robert Engström, Tommy Färnqvist, Peter Jonsson, Johan Thapper |
Properties of an Approximability-related Parameter on Circular Complete Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 35, pp. 115-120, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Adam Kasperski, Pawel Zielinski 0001 |
On the approximability of minmax (regret) network optimization problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 109(5), pp. 262-266, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Ning Chen |
On the Approximability of Influence in Social Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 23(3), pp. 1400-1415, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette |
On the Approximability of Comparing Genomes with Duplicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 13(1), pp. 19-53, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Jan Arpe, Bodo Manthey |
Approximability of Minimum AND-Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(3), pp. 337-357, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Circuit design, Inapproximability |
16 | David Pritchard |
Approximability of Sparse Integer Programs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0904.0859, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
16 | Haim Avron, Gil Shklarski, Sivan Toledo |
On Element SDD Approximability ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0911.0547, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
16 | Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker |
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0904.3756, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
16 | Spyros C. Kontogiannis, Paul G. Spirakis, Haralampos Tsaknakis |
Recent Advances in Approximability of Bimatrix Nash. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. EATCS ![In: Bull. EATCS 98, pp. 60-77, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
16 | Jacek Blazewicz, Edmund K. Burke, Marta Kasprzak, Alexandr Kovalev, Mikhail Y. Kovalyov |
On the approximability of the Simplified Partial Digest Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 157(17), pp. 3586-3592, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Bodo Manthey |
Minimum-weight cycle covers and their approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 157(7), pp. 1470-1480, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Sylvain Guillemot, François Nicolas, Vincent Berry, Christophe Paul |
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 157(7), pp. 1555-1570, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Andreas Bley |
Approximability of unsplittable shortest path routing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 54(1), pp. 23-46, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Michael Yu. Khachay, Maria I. Poberii |
Complexity and Approximability of Committee Polyhedral Separability of Sets in General Position. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Informatica ![In: Informatica 20(2), pp. 217-234, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
16 | Josep Díaz, Maria J. Serna, Paul G. Spirakis, Jacobo Torán |
Paradigms for fast parallel approximability (Reprint from 1997). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2009 |
RDF |
|
16 | Nikhil Bansal 0001, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko |
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 77-86, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
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) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 1058-1067, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei Wang 0010 |
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 755-764, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Jan Vondrák |
Symmetry and Approximability of Submodular Maximization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 651-670, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
submodular functions. matroids, multilinear extension, approximation algorithms |
16 | David Pritchard |
Approximability of Sparse Integer Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 83-94, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Wenliang Du, David Eppstein, Michael T. Goodrich, George S. Lueker |
On the Approximability of Geometric and Geographic Generalization and the Min-Max Bin Covering Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, pp. 242-253, 2009, Springer, 978-3-642-03366-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Carsten Gutwenger, Petra Mutzel, Bernd Zey |
On the Hardness and Approximability of Planar Biconnectivity Augmentation. ![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. 249-257, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Xi Chen 0001, Xiaotie Deng |
Non-approximability of Bimatrix Nash Equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Algorithms ![In: Encyclopedia of Algorithms - 2008 Edition, 2008, Springer, 978-0-387-30770-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | John Christopher McCabe-Dansted, Geoffrey Pritchard, Arkadii M. Slinko |
Approximability of Dodgson's rule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soc. Choice Welf. ![In: Soc. Choice Welf. 31(2), pp. 311-330, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Julia Chuzhoy, Anupam Gupta 0001, Joseph Naor, Amitabh Sinha |
On the approximability of some network design problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(2), pp. 23:1-23:17, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
cost-distance, fixed charge network flow, priority Steiner tree, network design, Hardness of approximation |
16 | Takehiro Ito, Erik D. Demaine, Xiao Zhou 0001, Takao Nishizeki |
Approximability of partitioning graphs with supply and demand. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 6(4), pp. 627-650, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Xujin Chen, Xiaodong Hu 0001, Xiaohua Jia |
Inapproximability and approximability of minimal tree routing and coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 6(2), pp. 341-351, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Anna Bernasconi 0001, Valentina Ciriani, Roberto Cordone |
The optimization of kEP-SOPs: Computational complexity, approximability and experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 13(2), pp. 35:1-35:31, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
multilevel logic synthesis, optimization, approximation algorithm, testing, Automatic synthesis |
16 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette |
On the Approximability of Comparing Genomes with Duplicates ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0806.1103, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
16 | |
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0802.2736, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
16 | Tommy Färnqvist, Peter Jonsson, Johan Thapper |
Approximability Distance in the Space of H-Colourability Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0802.0423, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
16 | Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen |
Approximability and parameterized complexity of minmax values ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0806.4344, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
16 | Adam Kasperski, Pawel Zielinski 0001 |
On the approximability of minmax (regret) network optimization problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0804.0396, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
16 | Rodolphe Giroudeau, Jean-Claude König |
General scheduling non-approximability results in presence of hierarchical communications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 184(2), pp. 441-457, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Yury L. Orlovich, Gerd Finke, Valery S. Gordon, Igor E. Zverovich |
Approximability results for the maximum and minimum maximal induced matching problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 5(3), pp. 584-593, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour |
Combination Can Be Hard: Approximability of the Unique Coverage Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 38(4), pp. 1464-1483, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Ning Chen |
On the approximability of influence in social networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 1029-1037, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
16 | Sébastien Angibaud, Guillaume Fertin, Irena Rusu |
On the Approximability of Comparing Genomes with Duplicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008., pp. 34-45, 2008, Springer, 978-3-540-77890-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
conserved intervals, genome rearrangement, duplicates, breakpoints, adjacencies, common intervals, APX-Hardness |
16 | Deeparnab Chakrabarty, Gagan Goel |
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 687-696, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | René A. Sitters |
Approximability of Average Completion Time Scheduling on Unrelated Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings, pp. 768-779, 2008, Springer, 978-3-540-87743-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen |
Approximability and Parameterized Complexity of Minmax Values. ![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. 684-695, 2008, Springer, 978-3-540-92184-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Eric Brelsford, Piotr Faliszewski, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor |
Approximability of Manipulating Elections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008, pp. 44-49, 2008, AAAI Press, 978-1-57735-368-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
16 | Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon |
A Soft Constraint of Equality: Complexity and Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings, pp. 358-371, 2008, Springer, 978-3-540-85957-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Zoran Nikoloski, Sergio Grimbs, Joachim Selbig, Oliver Ebenhöh |
Hardness and Approximability of the Inverse Scope Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings, pp. 99-112, 2008, Springer, 978-3-540-87360-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
completeness, scope, metabolic networks |
16 | Giorgio Ausiello, Vangelis Th. Paschos |
Reductions That Preserve Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics ![In: Handbook of Approximation Algorithms and Metaheuristics., 2007, Chapman and Hall/CRC, 978-1-58488-550-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Hans-Joachim Böckenhauer, Luca Forlizzi, Juraj Hromkovic, Joachim Kneis, Joachim Kupke 0002, Guido Proietti, Peter Widmayer |
On the Approximability of TSP on Local Modifications of Optimally Solved Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmic Oper. Res. ![In: Algorithmic Oper. Res. 2(2), pp. 83-93, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
16 | Jukka Suomela |
Approximability of identifying codes and locating-dominating codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 103(1), pp. 28-33, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | David Coudert, Pallab Datta, Stephane Perennes, Hervé Rivano, Marie-Emilie Voge |
Shared Risk Resource Group Complexity and Approximability Issues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Process. Lett. ![In: Parallel Process. Lett. 17(2), pp. 169-184, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Giorgio Bartolini, Elisabetta Punta, Tullio Zolezzi |
Approximability Properties for Second-Order Sliding Mode Control Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Autom. Control. ![In: IEEE Trans. Autom. Control. 52(10), pp. 1813-1825, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh |
Approximability of the capacitated b-edge dominating set problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 385(1-3), pp. 202-213, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Yijia Chen, Martin Grohe, Magdalena Grüber |
On Parameterized Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR07, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
16 | Qiaoming Han, Abraham P. Punnen |
On the approximability of the vertex cover and related problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0712.3333, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
16 | Peng Cui 0008 |
Improved Approximability Result for Test Set with Small Redundancy ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0705.2503, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|