|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 269 occurrences of 147 keywords
|
|
|
Results
Found 453 publication records. Showing 453 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
113 | Constantinos Daskalakis, Christos H. Papadimitriou |
On oblivious PTAS's for nash equilibrium. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 75-84, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
anonymous games, oblivious algorithms, PTAS, bimatrix games |
67 | Zhao Zhang 0002, Xiaofeng Gao 0001, Weili Wu 0001, Ding-Zhu Du |
PTAS for Minimum Connected Dominating Set in Unit Ball Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WASA ![In: Wireless Algorithms, Systems, and Applications, Third International Conference, WASA 2008, Dallas, TX, USA, October 26-28, 2008. Proceedings, pp. 154-161, 2008, Springer, 978-3-540-88581-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
wireless sensor network, connected dominating set, unit ball graph |
67 | Xiuzhen Huang, Jianer Chen |
On PTAS for Planar Graph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), IFIP 19th World Computer Congress, TC-1 Foundations of Computer Science, August 23-24, 2006, Santiago, Chile, pp. 299-313, 2006, Springer, 0-387-34633-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
65 | Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli |
On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003, Proceedings, pp. 319-328, 2003, Springer, 3-540-20695-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
scheduling, Approximation, PTAS, job shop |
59 | Zhi-Zhong Chen, Lusheng Wang 0001, Zhanyong Wang |
Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(4), pp. 501-529, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Duplication models, Approximation algorithms, Tandem repeats |
59 | Artur Czumaj, Andrzej Lingas |
Fast Approximation Schemes for Euclidean Multi-connectivity Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 856-868, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
58 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx |
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 211-220, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Steiner forest, bounded-genus graphs, bounded-treewidth graphs, planar graphs, PTAS, series-parallel graphs |
55 | Tim Nieberg, Johann L. Hurink |
A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers, pp. 296-306, 2005, Springer, 3-540-32207-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
55 | Clint Hepner, Clifford Stein 0001 |
Implementation of a PTAS for Scheduling with Release Dates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Algorithm Engineering and Experimentation, Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001, Revised Papers, pp. 202-215, 2001, Springer, 3-540-42560-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
53 | Yuzhong Zhang, Zhigang Cao 0002 |
An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 16(2), pp. 119-126, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Non-identical job sizes, Asymptotic PTAS, Scheduling, Makespan, Batching |
48 | Marta Z. Kwiatkowska, Gethin Norman, David Parker 0001 |
Stochastic Games for Verification of Probabilistic Timed Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FORMATS ![In: Formal Modeling and Analysis of Timed Systems, 7th International Conference, FORMATS 2009, Budapest, Hungary, September 14-16, 2009. Proceedings, pp. 212-227, 2009, Springer, 978-3-642-04367-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
48 | Hadas Shachnai, Tami Tamir |
Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement. ![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. 165-177, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
48 | Chandra Chekuri, Sanjeev Khanna |
Approximation schemes for preemptive weighted flow time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 297-305, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
46 | Bin Fu, Yumei Huo, Hairong Zhao |
Makespan Minimization with Machine Availability Constraints. ![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. 430-437, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
machine availability constraints, makespan, PTAS, inapproximation |
43 | Joseph S. B. Mitchell |
A PTAS for TSP with neighborhoods among fat regions in the plane. ![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. 11-18, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
43 | Khaled M. Elbassioni, René Sitters, Yan Zhang 0021 |
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 451-462, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos |
Poly-APX- and PTAS-Completeness in Standard and Differential Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 124-136, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
43 | Chandra Chekuri, Sanjeev Khanna |
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 848-861, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
average completion time, uniformly related machines, weighted completion time, scheduling, Polynomial time approximation scheme |
36 | Elad Hazan, Robert Krauthgamer |
How hard is it to approximate the best Nash equilibrium? ![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. 720-727, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Jianping Li 0007, Weidong Li 0002, Jianbo Li |
Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision. ![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. 1-13, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Scheduling, allocation, polynomial time approximation scheme, fully polynomial time approximation scheme, grade of service |
36 | Hadas Shachnai, Tami Tamir, Omer Yehezkely |
Approximation Schemes for Packing with Item Fragmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 43(1), pp. 81-98, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Item fragmentation, Algorithms, Linear programming, Bin packing, Polynomial time approximation schemes |
36 | Monaldo Mastrolilli, Ola Svensson |
(Acyclic) JobShops are Hard to Approximate. ![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. 583-592, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Peerapong Dhangwatnotai, Shahar Dobzinski, Shaddin Dughmi, Tim Roughgarden |
Truthful Approximation Schemes for Single-Parameter Agents. ![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. 15-24, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Liming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond |
The Complexity of Polynomial-Time Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(3), pp. 459-477, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Hadas Shachnai, Tami Tamir, Omer Yehezkely |
Approximation Schemes for Packing with Item Fragmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers, pp. 334-347, 2005, Springer, 3-540-32207-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Wenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh S. Vempala |
Tensor decomposition and approximation schemes for constraint satisfaction problems. ![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. 747-754, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
approximation scheme, tensor decomposition |
36 | Leah Epstein, Tamir Tassa |
Approximation schemes for the Min-Max Starting Time Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 40(9), pp. 657-674, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Murali K. Ganapathy, Sachin Lodha |
On Minimum Circular Arrangement. ![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. 394-405, 2004, Springer, 3-540-21236-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
36 | Artur Czumaj, Andrzej Lingas, Hairong Zhao |
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 973-984, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
36 | John E. Augustine, Steven S. Seiden |
Linear Time Approximation Schemes for Vehicle Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 30-39, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
34 | Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani |
On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADHOC-NOW ![In: Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, ADHOC-NOW 2009, Murcia, Spain, September 22-25, 2009, Proceedings, pp. 194-212, 2009, Springer, 978-3-642-04382-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Intruder, Optimal Movement, Sensors, NP-complete, Coverage, Detection, PTAS, Barrier, Line Segment |
34 | Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips |
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 50(2), pp. 279-298, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Manhattan distance, Clustering, Approximation, Supercomputers, Communication cost, Processor allocation, Polynomial-time approximation scheme (PTAS) |
34 | Omid Amini, Stéphane Pérennes, Ignasi Sau |
Hardness and Approximation of Traffic Grooming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 561-573, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
SONET ADM, Approximation Algorithms, Optical Networks, PTAS, inapproximability, Traffic Grooming, APX-hardness |
34 | Matthias Müller-Hannemann, Siamak Tazari |
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pp. 151-162, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Uniform Orientation Metric, Banyan, Planar Graph, Steiner Tree, Spanner, PTAS, Obstacles, Euclidean Metric |
34 | Ashkan Aazami, Michael D. Stilp |
Approximation Algorithms and Hardness for Domination with Propagation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings, pp. 1-15, 2007, Springer, 978-3-540-74207-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Power Dominating Set, Approximation Algorithms, Integer Programming, Planar Graphs, Greedy Algorithms, Dominating Set, Hardness of Approximation, PTAS |
34 | Amitai Armon, Yossi Azar, Leah Epstein |
Temporary Tasks Assignment Resolved. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 36(3), pp. 295-314, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Unrelated machines, Load balancing, Competitive, On-line, PTAS |
31 | Anna Adamaszek, Artur Czumaj, Andrzej Lingas |
PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k. ![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. 994-1003, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Nabil H. Mustafa, Saurabh Ray |
PTAS for geometric hitting set problems via local search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 17-22, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithm, local search, hitting sets, epsilon nets |
31 | Tim Nonner, Alexander Souza |
Latency Constrained Aggregation in Chain Networks Admits a PTAS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings, pp. 279-291, 2009, Springer, 978-3-642-02157-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
31 | Christian Glaßer, Christian Reitwießner, Heinz Schmitz |
Multiobjective Disk Cover Admits a PTAS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 40-51, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pp. 290-298, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Shuai Cheng Li 0001, Yen Kaow Ng, Louxin Zhang |
A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Second Annual International Workshop, FAW 2008, Changsha, China, June 19-21, 2008, Proceeedings, pp. 35-44, 2008, Springer, 978-3-540-69310-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Andreas Wiese, Evangelos Kranakis |
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCOSS ![In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, Santorini Island, Greece, June 11-14, 2008, Proceedings, pp. 415-431, 2008, Springer, 978-3-540-69169-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Dan Feldman, Morteza Monemizadeh, Christian Sohler |
A PTAS for k-means clustering based on weak coresets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 11-18, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
approximation, k-mean, geometric optimization, coresets |
31 | Yuzhong Zhang, Zhigang Cao |
An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings, pp. 44-51, 2007, Springer, 978-3-540-73555-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Xiaotie Deng, Haodi Feng, Guojun Li, Benyun Shi |
A PTAS for Semiconductor Burn-in Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(1), pp. 5-17, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
geometric rounding, time stretching, approximation algorithm, batch processing, release date |
31 | Yuzhong Zhang, Zhigang Cao, Qingguo Bai |
A PTAS for Scheduling on Agreeable Unrelated Parallel Batch Processing Machines with Dynamic Job Arrivals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings, pp. 162-171, 2005, Springer, 3-540-26224-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Subhash Khot |
Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 136-145, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Mao-cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu |
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 304-314, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002, Asaf Levin |
Finding mobile data under delay constraints with searching costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 297-304, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
partitioning and scheduling, approximation algorithms, design and analysis of algorithms |
24 | Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia |
On truthfulness and approximation for scheduling selfish tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 12(5), pp. 437-445, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Scheduling, Approximation algorithms, Game theory, Truthfulness |
24 | Imran A. Pirwani |
Shifting Strategy for Geometric Graphs without Geometry. ![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. 362-371, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Cristina Bazgan, Basile Couëtoux, Zsolt Tuza |
Covering a Graph with a Constrained Forest (Extended Abstract). ![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. 892-901, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Klaus Jansen |
Parameterized approximation scheme for the multiple knapsack problem. ![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. 665-674, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Avner Magen, Mohammad Moharrami |
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 258-271, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | 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 |
|
24 | Maria Liazi, Ioannis Milis, Fanny Pascual, Vassilis Zissimopoulos |
The densest k-subgraph problem on clique graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(4), pp. 465-474, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Densest k-subgraph, Clique graph, Dynamic programming, Polynomial time approximation scheme |
24 | Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram |
Approximation Algorithms for Scheduling with Reservations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPC ![In: High Performance Computing - HiPC 2007, 14th International Conference, Goa, India, December 18-21, 2007, Proceedings, pp. 297-307, 2007, Springer, 978-3-540-77219-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Dániel Marx |
On the Optimality of Planar and Geometric Approximation Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 338-348, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | André Berger, Michelangelo Grigni |
Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 90-101, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Kuen-Lin Yu, Chung-Shou Liao, D. T. Lee |
Maximizing the Number of Independent Labels in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings, pp. 136-147, 2007, Springer, 978-3-540-73813-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Jan Remy, Reto Spöhel, Andreas Weißl |
On Euclidean Vehicle Routing with Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pp. 601-612, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Claire Kenyon-Mathieu, Warren Schudy |
How to rank with few errors. ![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. 95-103, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Kemeny-Young rank aggregation, feedback arc set, max acyclic subgraph, tournament graphs, approximation algorithm, polynomial-time approximation scheme |
24 | Lusheng Wang 0001, Zhanyong Wang, Zhi-Zhong Chen |
Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 493-503, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella |
The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 46(2), pp. 193-221, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Jens Gramm, Jiong Guo, Rolf Niedermeier |
Parameterized Intractability of Distinguishing Substring Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 39(4), pp. 545-560, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Ioannis Giotis 0001, Venkatesan Guruswami |
Correlation clustering with a fixed number of clusters. ![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. 1167-1176, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | 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 |
|
24 | Xiuzhen Huang |
Lower Bounds and Parameterized Approach for Longest Common Subsequence. ![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. 136-145, 2006, Springer, 3-540-36925-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Rajeev Alur, Swarat Chaudhuri |
Branching Pushdown Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings, pp. 393-404, 2006, Springer, 3-540-49994-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Tao Jiang 0001 |
Correlation Clustering and Consensus Clustering. ![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. 226-235, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Miroslav Chlebík, Janka Chlebíková |
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 267-276, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
24 | Brona Brejová, Daniel G. Brown 0001, Ian M. Harrower, Alejandro López-Ortiz, Tomás Vinar |
Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings, pp. 1-10, 2005, Springer, 3-540-26201-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Dániel Marx |
Efficient Approximation Schemes for Geometric Problems?. ![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. 448-459, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Andreas Björklund |
Approximating Integer Quadratic Programs and MAXCUT in Subdense Graphs. ![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. 839-849, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Michael A. Bender, S. Muthukrishnan 0001, Rajmohan Rajaraman |
Approximation Algorithms for Average Stretch Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 7(3), pp. 195-222, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
average stretch, approximation algorithms, Scheduling algorithms |
24 | Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri |
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. ![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. 418-427, 2004, Springer, 3-540-21236-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Hadas Shachnai, Oded Shmueli, Robert Sayegh |
Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers, pp. 111-125, 2004, Springer, 3-540-24574-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Yen Hung Chen, Bang Ye Wu, Chuan Yi Tang |
Approximation Algorithms for k-Source Bottleneck Routing Cost Spanning Tree Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part III, pp. 355-366, 2004, Springer, 3-540-22057-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithm, spanning tree, polynomial time approximation scheme, Combinatorial optimization problem |
24 | Moses Charikar, Venkatesan Guruswami, Anthony Wirth |
Clustering with Qualitative Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pp. 524-533, 2003, IEEE Computer Society, 0-7695-2040-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Alberto Caprara, Andrea Lodi 0001, Michele Monaci |
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings, pp. 315-328, 2002, Springer, 3-540-43676-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella |
The freeze-tag problem: how to wake up a swarm of robots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 568-577, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
24 | Piotr Berman, Marek Karpinski |
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 623-632, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Binhai Zhu |
Approximating 3D Points with Cylindrical Segments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 420-429, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Markus Bläser, Bodo Siebert |
Computing Cycle Covers without Short Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, pp. 368-379, 2001, Springer, 3-540-42493-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Hadas Shachnai, Tami Tamir |
Polynominal time approximation schemes for class-constrained packing problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 238-249, 2000, Springer, 3-540-67996-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Tao Jiang 0001, Paul E. Kearney, Ming Li 0001 |
Orchestrating Quartets: Approximation and Data Correction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 416-425, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
quartet, approximation, recombination, evolutionary tree, cleaning |
22 | Balabhaskar Balasundaram, Sergiy Butenko |
Optimization Problems in Unit-Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 2832-2844, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Coloring, Dominating sets, Independent sets, PTAS, Cliques, Unit-disk graphs |
22 | Tim Nieberg, Johann L. Hurink, Walter Kern |
Approximation schemes for wireless networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(4), pp. 49:1-49:17, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded growth, Wireless ad-hoc networks, PTAS, maximum independent set, minimum dominating set |
22 | Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh 0001 |
Degree-Constrained Subgraph Problems: Hardness and Approximation Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers, pp. 29-42, 2008, Springer, 978-3-540-93979-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Degree-Constrained Subgraphs, Apx, Excluded Minor, Approximation Algorithms, Hardness of Approximation, PTAS |
22 | Yen Hung Chen, Gwo-Liang Liao, Chuan Yi Tang |
Approximation Algorithms for 2-Source Minimum Routing Cost k -Tree Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2007, International Conference, Kuala Lumpur, Malaysia, August 26-29, 2007. Proceedings. Part III, pp. 520-533, 2007, Springer, 978-3-540-74482-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
approximation algorithm, polynomial time approximation scheme (PTAS), combinatorial optimization problem, k-tree |
22 | Sándor P. Fekete, Henk Meijer |
Maximum Dispersion and Geometric Maximum Weight Cliques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(3), pp. 501-511, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Remote clique, Heaviest subgraph, Approximation, Facility location, PTAS, Geometric optimization, Dispersion, Maximum weight cliques |
22 | Kunal Talwar |
Bypassing the embedding: algorithms for low dimensional metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 281-290, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
TSP, PTAS, routing schemes, doubling metrics, distance labels |
22 | Tom Korsmeyer, Jun Zeng, Ken Greiner |
Design tools for BioMEMS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 41th Design Automation Conference, DAC 2004, San Diego, CA, USA, June 7-11, 2004, pp. 622-628, 2004, ACM, 1-58113-828-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
BEM, CAD, MEMS, PTAS, FEM, system-level modeling, lab-on-a-chip, BioMEMS |
22 | Xiang-Yang Li 0001, Yu Wang 0003 |
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DIAL-M ![In: Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2002), Atlanta, Georgia, USA, September 28-28, 2002, pp. 62-71, 2002, ACM, 1-58113-587-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
disk graphs, wireless ad hoc networks, independent set, PTAS, vertex cover, vertex coloring |
22 | Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia |
Optimal covering tours with turn costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 138-147, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
m-guillotine subdivisions, lawn mowing, milling, turn costs, approximation algorithms, NP-completeness, traveling salesman problem (TSP), manufacturing, polynomial-time approximation scheme (PTAS), covering, NC machining |
19 | Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang |
A PTAS for ℓ0-Low Rank Approximation: Solving Dense CSPs over Reals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pp. 935-961, 2024, SIAM, 978-1-61197-791-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
19 | Balázs F. Mezei, Marcin Wrochna, Stanislav Zivný |
PTAS for Sparse General-valued CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 19(2), pp. 14:1-14:31, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Claire Mathieu, Hang Zhou 0001 |
A PTAS for Capacitated Vehicle Routing on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 19(2), pp. 17:1-17:28, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
19 | Miguel Bosch-Calvo, Fabrizio Grandoni 0001, Afrouz Jabal Ameli |
A PTAS for Triangle-Free 2-Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.11869, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 453 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ >>] |
|