The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase Approximation algorithm (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1976-1986 (17) 1987-1989 (20) 1990-1991 (22) 1992 (18) 1993 (27) 1994 (21) 1995 (32) 1996 (32) 1997 (36) 1998 (64) 1999 (77) 2000 (91) 2001 (107) 2002 (129) 2003 (171) 2004 (197) 2005 (279) 2006 (264) 2007 (275) 2008 (299) 2009 (253) 2010 (87) 2011 (62) 2012 (28)
Publication types (Num. hits)
article(804) incollection(7) inproceedings(1797)
Venues (Conferences, Journals, ...)
SODA(152) Algorithmica(103) ESA(90) ISAAC(88) STOC(83) FOCS(68) ICALP(62) APPROX-RANDOM(59) IPCO(52) CoRR(48) COCOON(47) Inf. Process. Lett.(45) WAOA(40) J. Comb. Optim.(39) SWAT(35) ACM Transactions on Algorithms(34) More (+10 of total 476)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2472 occurrences of 961 keywords

Results
Found 2608 publication records. Showing 2608 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
3Joseph S. B. Mitchell A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2010 DBLP  DOI  BibTeX  RDF approximation algorithm, TSP
3Zhenbo Wang, Wenxun Xing A successive approximation algorithm for the multiple knapsack problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithm, Worst-case analysis, Multiple knapsack problem
3Qinghua Zhu, Deying Li An Approximation Algorithm for Conflict-Aware Many-to-One Data Aggregation Scheduling in Wireless Sensor Networks. Search on Bibsonomy WASA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Conflict-aware, many-to-one data aggregation, wireless sensor network, approximation algorithm, latency
3Hengwu Li Approximation algorithm and scheme for RNA structure prediction. Search on Bibsonomy Int. Conf. Interaction Sciences The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithm, approximation scheme, RNA structure, pseudoknot
3Zhipeng Cai, Randy Goebel, Guohui Lin Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Capacitated Multicast Tree Routing, Approximation Algorithm, Tree Partitioning
3Yen Hung Chen A Fast Approximation Algorithm for the k Partition-Distance Problem. Search on Bibsonomy ICCSA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF partition-distance, data mining, clustering, approximation algorithm, bioinformatics, partitioning, consensus clustering
3Daisuke Yamaguchi, Shinji Imahori, Ryuhei Miyashiro, Tomomi Matsui An Improved Approximation Algorithm for the Traveling Tournament Problem. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF traveling tournament problem, scheduling, approximation algorithm, lower bound, timetabling
3Markus Bläser A new approximation algorithm for the asymmetric TSP with triangle inequality. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Approximation algorithm, TSP, traveling salesman problem, cycle cover
3Maleq Khan, Gopal Pandurangan A fast distributed approximation algorithm for minimum spanning trees. Search on Bibsonomy Distributed Computing The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Randomized algorithm, Minimum spanning tree, Distributed approximation algorithm
3Jianxin Wang, Xiaoshuang Xu, Jianer Chen Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Min-CVCB, parameter complexity, chain implication, approximation algorithm
3Paul S. Bonsma, Florian Zickfeld A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF maximum leaf, approximation algorithm, connected dominating set, cubic graph
3Zhipeng Cai, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Capacitated Multicast Tree Routing, Approximation Algorithm, Tree Partitioning, Steiner Minimum Tree
3Bach Kim Nguyen Thi, Le Thi Hoai An, Minh Thanh Tran Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets. Search on Bibsonomy MCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Increasing function, Polyblock approximation algorithm, Multiple objective linear programming, Optimization over the efficient set
3Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Thai, Hongqiang Zhai, Yuguang Fang An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks. Search on Bibsonomy MobiHoc The full citation details ... 2008 DBLP  DOI  BibTeX  RDF conflict-aware, approximation algorithm, wireless networks, broadcast scheduling
3Jingui Huang, Jianer Chen, Songqiao Chen, Jianxin Wang A simple linear time approximation algorithm for multi-processor job scheduling on four processors. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Multi-processor job scheduling, Approximation algorithm, NP-hard problem
3Christopher Ostler, Karam S. Chatha, Goran Konjevod Approximation Algorithm for Process Mapping on Network Processor Architectures. Search on Bibsonomy ASP-DAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Intel IXP2400 architecture, programmable network processor architectures, symmetric multiprocessing, automated system-level design, NP-complete problem, process mapping, polynomial time approximation algorithm, block multithreading
3Sanjeev Arora, George Karakostas A 2 + epsilon approximation algorithm for the k-MST problem. Search on Bibsonomy Math. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF k-Minimum Spanning Tree, Primal-Dual schema, Approximation algorithm
3Maleq Khan, Gopal Pandurangan A Fast Distributed Approximation Algorithm for Minimum Spanning Trees. Search on Bibsonomy DISC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Minimum Spanning Tree, Distributed Approximation Algorithm
3Guohui Lin An Improved Approximation Algorithm for Multicast k-Tree Routing. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF multicast k-tree routing, weight averaging, approximation algorithm, tree partitioning, Steiner minimum tree
3Doratha E. Drake Vinkemeier, Stefan Hougardy A linear-time approximation algorithm for weighted matchings in graphs. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Approximation algorithm, maximum weight matching
3Refael Hassin, Asaf Levin An Approximation Algorithm for the Minimum Latency Set Cover Problem. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Minimum sum set cover, minimum latency, approximation algorithm
3Yun Cui, Lusheng Wang, Daming Zhu A 1.75-Approximation Algorithm for Unsigned Translocation Distance. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Unsigned translocation distance, Approximation algorithm
3Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky A New Approximation Algorithm for Finding Heavy Planar Subgraphs. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Weighted planar graph, Approximation algorithm, Performance ratio
3Renaud Lepère, Christophe Rapine An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs. Search on Bibsonomy STACS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Scheduling, approximation algorithm, makespan, performance guarantee, duplication, communication times
3Joseph Naor, Leonid Zosin A 2-Approximation Algorithm for the Directed Multiway Cut Problem. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF directed multiway cut problem, 2-approximation algorithm, multiway flow function, NP-complete, directed graphs, polynomial-time algorithm, approximation factor
3Ingo Schiermeyer An Approximation Algorithm for 3-Colourability. Search on Bibsonomy WG The full citation details ... 1995 DBLP  DOI  BibTeX  RDF k-colouring, exact and approximation algorithm, complexity, Graph
3Kequin Li Probabilistic analysis of an approximation algorithm for maximum subset sum using recurrence relations. Search on Bibsonomy ACM Southeast Regional Conference The full citation details ... 1995 DBLP  DOI  BibTeX  RDF maximum subset sum, multiprogrammed parallel system, sequential selection, approximation algorithm, probabilistic analysis, knapsack, recurrence relations
2Zi Xu A combined direction stochastic approximation algorithm. Search on Bibsonomy Optimization Letters The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Robbins-Monro algorithm, Combined direction, Almost sure, Asymptotic rate of convergence, Stochastic approximation
2Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira Computing similarity between piecewise-linear functions. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2010 DBLP  DOI  BibTeX  RDF polyhedral terrain, approximation algorithm, randomized algorithm, similarity, piecewise-linear function
2Guang Xu, Jinhui Xu An improved approximation algorithm for uncapacitated facility location problem with penalties. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Algorithms, Approximation algorithms, Outliers, Facility location problem
2Julián Mestre A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithms, Vertex cover, Primal-dual algorithms
2Pangfeng Liu, May-Chen Kuo, Da-Wei Wang An Approximation Algorithm and Dynamic Programming for Reduction in Heterogeneous Environments. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Heterogeneous workstation cluster, Reduction protocol, Slowest-node-first heuristic, Dynamic programming, Scheduling optimization, Branch-and-bound search
2Guy Even, Jon Feldman, Guy Kortsarz, Zeev Nutov A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithms, graphs, connectivity
2Xin Chen, Yun Cui An Approximation Algorithm for the Minimum Breakpoint Linearization Problem. Search on Bibsonomy IEEE/ACM Trans. Comput. Biology Bioinform. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF partially ordered genomes, breakpoint distance, approximation algorithms, Comparative genomics
2Eric McDermid A 3/2-Approximation Algorithm for General Stable Marriage. Search on Bibsonomy ICALP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Christos Koufogiannakis, Neal E. Young Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. Search on Bibsonomy ICALP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan An Exponential Time 2-Approximation Algorithm for Bandwidth. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Piotr Berman, Marek Karpinski, Alexander Zelikovsky 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Matti Åstrand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto A Local 2-Approximation Algorithm for the Vertex Cover Problem. Search on Bibsonomy DISC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Viet Hung Nguyen A 2log2(n)-Approximation Algorithm for Directed Tour Cover. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Tim Nonner, Alexander Souza A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Katarzyna E. Paluch, Marcin Mucha, Aleksander Madry A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
2Yao-Chung Fan, Arbee L. P. Chen An Approximation Algorithm for Optimizing Multiple Path Tracking Queries over Sensor Data Streams. Search on Bibsonomy DEXA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Sensor Network, Query Processing, Distributed Database, Query Optimization
2Yuichi Yoshida, Masaki Yamamoto, Hiro Ito An improved constant-time approximation algorithm for maximum~matchings. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover
2Solmaz Kolahi, Laks V. S. Lakshmanan On approximating optimum repairs for functional dependency violations. Search on Bibsonomy ICDT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF functional dependency violation, approximation algorithm, repair, inconsistent databases
2Dong-Hoon Shin, Saurabh Bagchi Optimal monitoring in multi-channel multi-radio wireless mesh networks. Search on Bibsonomy MobiHoc The full citation details ... 2009 DBLP  DOI  BibTeX  RDF lp rounding, multi-channel multi-radio wireless networks, approximation algorithm, wireless mesh networks, security monitoring
2Vincent Berry, Christophe Paul, Sylvain Guillemot, François Nicolas Linear time 3-approximation for the MAST problem. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF maximum agreement subtree, maximum compatible subtree, Approximation algorithm, phylogenetic tree
2Guy Kortsarz, Zeev Nutov Approximating Some Network Design Problems with Node Costs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation
2Zheng Li, Deying Li Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks with Directional Antennas. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF ad hoc and sensor networks, approximation algorithm, energy efficient, broadcast, directional antenna
2Xianyue Li, XiaoHua Xu, Feng Zou, Hongwei Du, Peng-Jun Wan, Yuexuan Wang, Weili Wu A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Node-weighted Steiner tree, minimum weighted connected dominating set, approximation algorithm, polynomial-time approximation scheme
2Chung-Shou Liao, Louxin Zhang Approximating the Spanning k-Tree Forest Problem. Search on Bibsonomy FAW The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Spanning forest, approximation algorithm, star, k-tree
2Zheng Fang, Jie Wang, Donghui Zhang Workload-Driven Compressed Skycube Queries in Wireless Applications. Search on Bibsonomy WASA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Compressed skycube, approximation algorithm
2Xujin Chen, Bo Chen Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Soft capacity, Approximation algorithm, Network design, Facility location, Performance guarantee
2Leah Epstein, Thomas Erlebach, Asaf Levin Variable Sized Online Interval Coloring with Bandwidth. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Interval coloring, Approximation algorithm, Lower bound, Competitive analysis
2Romeo Rizzi Minimum Weakly Fundamental Cycle Bases Are Hard To Find. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Minimum cycle basis problem, Weakly fundamental cycle basis, Fundamental cycle basis, Computational complexity, Approximation algorithm, Combinatorial optimization, Graphs
2Aparna Das, Claire Kenyon-Mathieu On Hierarchical Diameter-Clustering and the Supplier Problem. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithm, Online algorithm, Hierarchical clustering
2Takuro Fukunaga, Hiroshi Nagamochi Network Design with Edge-Connectivity and Degree Constraints. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Degree constraint, (m,n)-VRP, Approximation algorithm, TSP, Vehicle routing problem, Edge-connectivity
2Yi Shi, Y. Thomas Hou, Alon Efrat Algorithm design for a class of base station location problems in sensor networks. Search on Bibsonomy Wireless Networks The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Base station placement, Wireless sensor networks, Approximation algorithm, Complexity, Network lifetime, Network capacity
2Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi A (2-c(1/sqrt(N)))-Approximation Algorithm for the Stable Marriage Problem. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF The stable marriage problem, Incomplete lists, Approximation algorithms, Ties
2Yinyin Liu, Janusz A. Starzyk, Zhen Zhu Optimized Approximation Algorithm in Neural Networks Without Overfitting. Search on Bibsonomy IEEE Transactions on Neural Networks The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Magnus Bordewich, Charles Semple Nature Reserve Selection Problem: A Tight Approximation Algorithm. Search on Bibsonomy IEEE/ACM Trans. Comput. Biology Bioinform. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Trees, Combinatorial algorithms
2Yun Cui, Lusheng Wang, Daming Zhu, Xiaowen Liu A (1.5 + epsilon)-Approximation Algorithm for Unsigned Translocation Distance. Search on Bibsonomy IEEE/ACM Trans. Comput. Biology Bioinform. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF unsigned translocation and approximation algorithms, Genome rearrangement
2Ke Chen 0006 A constant factor approximation algorithm for k-median clustering with outliers. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang An Improved Randomized Approximation Algorithm for Maximum Triangle Packing. Search on Bibsonomy AAIM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Zeyu Guo, He Sun, Hong Zhu A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem. Search on Bibsonomy AAIM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2James Glenn, Haw-ren Fang, Clyde P. Kruskal A Retrograde Approximation Algorithm for Multi-player Can't Stop. Search on Bibsonomy Computers and Games The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Ioannis Caragiannis, Gianpiero Monaco A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Andrzej Lingas, Agnieszka Wasylewicz, Pawel Zylinski Linear-Time 3-Approximation Algorithm for the r -Star Covering Problem. Search on Bibsonomy WALCOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Yiliang Xu, Dezhen Song, Jingang Yi, A. Frank van der Stappen An approximation algorithm for the least overlapping p-Frame problem with non-partial coverage for networked robotic cameras. Search on Bibsonomy ICRA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Gyouhwan Kim, Qiao Li, Rohit Negi A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks. Search on Bibsonomy ICC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Hubert Larchevêque Distributed Approximation Algorithm for Resource Clustering. Search on Bibsonomy SIROCCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Maytham Safar, Nisreen Al-Masri Approximation algorithm using: Neighbors, history and errors (NHE). Search on Bibsonomy ICDIM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong Chwa Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Approximation algorithms, Primal-Dual algorithms, Facility location problem
2Lei Fang, Michael S. Hsiao A Fast Approximation Algorithm for MIN-ONE SAT. Search on Bibsonomy DATE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Xiaowen Lou, Daming Zhu A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations. Search on Bibsonomy COCOON The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt A Approximation Algorithm for the Minimum Maximal Matching Problem. Search on Bibsonomy WAOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
2Jittat Fakcharoenphol, Bundit Laekhanukit An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF approximation algorithms for NP-hard problems, k-connected spanning subgraphs, network design
2Shuchi Chawla, Anupam Gupta, Harald Räcke Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF negative-type metric, Approximation algorithm, metrics, embedding, sparsest cut
2Xin Chen, Lan Liu, Zheng Liu, Tao Jiang On the minimum common integer partition problem. Search on Bibsonomy ACM Transactions on Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF approximation algorithm, combinatorial optimization, NP-hard, computational biology, Subset sum, integer partition
2Subhas Kumar Ghosh Energy Efficient Broadcast in Distributed Ad Hoc Wireless Networks. Search on Bibsonomy CSE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Minimum Energy Broadcast, approximation algorithm, distributed algorithm
2Eric Angel, Evripidis Bampis, Laurent Gourvès On the Minimum Hitting Set of Bundles Problem. Search on Bibsonomy AAIM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF minimum hitting set, min k??sat, approximation algorithm
2Rongheng Li, Huei Chuen Huang A General k-Level Uncapacitated Facility Location Problem. Search on Bibsonomy ICIC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF k-level, Approximation algorithm, Complexity, Facility location
2Zeyu Guo, He Sun, Hong Zhu Greedy Construction of 2-Approximation Minimum Manhattan Network. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Minimum Manhattan Network, greedy strategy, approximation algorithm
2Zheng Fang, Jie Wang Convex Combination Approximation for the Min-Cost WSN Point Coverage Problem. Search on Bibsonomy WASA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF point coverage, minimum set multicover, approximation algorithm, sensor deployment, LP-rounding
2Wei-Lin Li, Peng Zhang, Daming Zhu On Constrained Facility Location Problems. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF approximation hardness, approximation algorithm, local search, Facility Location
2Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi A 1.875: approximation algorithm for the stable marriage problem. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Zhi-Zhong Chen, Ruka Tanahashi An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs. Search on Bibsonomy AAIM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem. Search on Bibsonomy AAIM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Zoë Abrams, Erik Vee Personalized Ad Delivery When Ads Fatigue: An Approximation Algorithm. Search on Bibsonomy WINE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Yi Shi, Yiwei Thomas Hou Approximation Algorithm for Base Station Placement in Wireless Sensor Networks. Search on Bibsonomy SECON The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Anna Bernasconi, Valentina Ciriani, Roberto Cordone An approximation algorithm for fully testable kEP-SOP networks. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF multilevel networks, testing, logic optimization
2Jianxin Wang, Xiaoshuang Xu, Jianer Chen An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. Search on Bibsonomy TAMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Peng Zhang An Approximation Algorithm to the k -Steiner Forest Problem. Search on Bibsonomy TAMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Sayaka Kamei, Hirotsugu Kakugawa A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set. Search on Bibsonomy IPDPS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Christopher Ostler, Karam S. Chatha Approximation Algorithm for Data Mapping on Block Multi-threaded Network Processor Architectures. Search on Bibsonomy DAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Hung-Yi Liu, Wan-Ping Lee, Yao-Wen Chang A Provably Good Approximation Algorithm for Power Optimization Using Multiple Supply Voltages. Search on Bibsonomy DAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Taolue Chen, Tingting Han, Jian Lu On Behavioral Metric for Probabilistic Systems: Definition and Approximation Algorithm. Search on Bibsonomy FSKD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Hongbin Luo, Lemin Li An Approximation Algorithm for Provisioning of Survivable Multicast Sessions in WDM Networks. Search on Bibsonomy ICCCN The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanjay E. Sarma A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems. Search on Bibsonomy WADS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
2Prabhakar Gubbala, Balaji Raghavachari A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity. Search on Bibsonomy WADS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Approximation algorithms, Combinatorial Optimization, Connectivity, Graph and network algorithms
Displaying result #1 - #100 of 2608 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.