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