Search results for "efficient approximation algorithms"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Andrei Lopatenko, Loreto Bravo	Efficient Approximation Algorithms for Repairing Inconsistent Databases.	ICDE	2007	DBLP DOI BibTeX RDF
1	Michalis G. Kallitsis, Stilian Stoev, George Michailidis	Efficient Approximation Algorithms for Optimal Large-scale Network Monitoring	CoRR	2012	DBLP BibTeX RDF
1	Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xuan Zeng	Efficient Approximation Algorithms for Chemical Mechanical Polishing Dummy Fill.	IEEE Trans. on CAD of Integrated Circuits and Systems	2011	DBLP DOI BibTeX RDF
1	Radu Marinescu	Efficient Approximation Algorithms for Multi-objective Constraint Optimization.	ADT	2011	DBLP DOI BibTeX RDF
1	Guang Xu, Jinhui Xu	Efficient approximation algorithms for clustering point-sets.	Comput. Geom.	2010	DBLP DOI BibTeX RDF
1	Andrzej Lingas, Eva-Marta Lundell	Efficient approximation algorithms for shortest cycles in undirected graphs.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
1	Ankan Saha, S. V. N. Vishwanathan	Efficient Approximation Algorithms for Minimum Enclosing Convex Shapes	CoRR	2009	DBLP BibTeX RDF
1	Alexandra Meliou, Carlos Guestrin, Joseph M. Hellerstein	Approximating sensor network queries using in-network summaries.	IPSN	2009	DBLP DOI BibTeX RDF
1	Zeinab Abbassi, Laks V. S. Lakshmanan	On Efficient Recommendations for Online Exchange Markets.	ICDE	2009	DBLP DOI BibTeX RDF
1	Jian Li, Amol Deshpande, Samir Khuller	Minimizing Communication Cost in Distributed Multi-query Processing.	ICDE	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Rina Panigrahy, Sergey Yekhanin	Deterministic Approximation Algorithms for the Nearest Codeword Problem.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
1	Jiguo Yu, Suxia Cui, Guanghui Wang	Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings.	COCOA	2009	DBLP DOI BibTeX RDF
1	Farzad Hassanzadeh, David Rappaport	Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments.	WADS	2009	DBLP DOI BibTeX RDF	Intersecting Polygon, Approximation Algorithm, Computational Geometry, Line Segment
1	Jan Arpe, Bodo Manthey	Approximability of Minimum AND-Circuits.	Algorithmica	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Circuit design, Inapproximability
1	Chia-Ching Ooi, Christian Schindelhauer	Minimal Energy Path Planning for Wireless Robots.	MONET	2009	DBLP DOI BibTeX RDF	optimal energy path planning, wireless communications cost, mobility cost, networked robots
1	Andrzej Lingas, Eva-Marta Lundell	Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs.	LATIN	2008	DBLP DOI BibTeX RDF
1	Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan Thulasiraman	Polynomial time approximation algorithms for multi-constrained QoS routing.	IEEE/ACM Trans. Netw.	2008	DBLP DOI BibTeX RDF	efficient approximation algorithms, multiple additive constraints, quality-of-service (QoS) routing
1	Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ranganathan, Hao Yang	A generic flow algorithm for shared filter ordering problems.	PODS	2008	DBLP DOI BibTeX RDF	flow maximization, shared filter ordering, parallel, query optimization
1	Abhimanyu Das, David Kempe	Sensor Selection for Minimizing Worst-Case Prediction Error.	IPSN	2008	DBLP DOI BibTeX RDF	estimation, spatial correlation, sensor selection, sensor placement
1	Xiaohua Dong, Ji Li, Zhongfu Wu, Dacheng Zhang, Jie Xu	On Dynamic Replication Strategies in Data Service Grids.	ISORC	2008	DBLP DOI BibTeX RDF	dynamic data replication, multiple-location replication, SOA, Approximation algorithms
1	Jaewoo Kang, Jeffrey F. Naughton	Schema Matching Using Interattribute Dependencies.	IEEE Trans. Knowl. Data Eng.	2008	DBLP DOI BibTeX RDF
1	Xiang-Yang Li, Ping Xu, ShaoJie Tang, Xiaowen Chu	Spectrum Bidding in Wireless Networks and Related.	COCOON	2008	DBLP DOI BibTeX RDF
1	Oren Kapah, Gad M. Landau, Avivit Levy, Nitsan Oz	Interchange Rearrangement: The Element-Cost Model.	SPIRE	2008	DBLP DOI BibTeX RDF	Interchange rearrangement, Cost models
1	Guoliang Xue, Arunabha Sen, Weiyi Zhang, Jian Tang, Krishnaiyan Thulasiraman	Finding a path subject to many additive QoS constraints.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	efficient approximation algorithms, multiple additive constraints, QoS routing
1	Chia-Ching Ooi, Christian Schindelhauer	Minimal energy path planning for wireless robots.	ROBOCOMM	2007	DBLP DOI BibTeX RDF
1	Mansoor Alicherry, Randeep Bhatia	Simple pre-provisioning scheme to enable fast restoration.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	fast shared restoration, local reroute, pre-provisioning, approximation algorithms, MPLS, optical
1	Dan Wang, Qian Zhang, Jiangchuan Liu	The self-protection problem in wireless sensor networks.	TOSN	2007	DBLP DOI BibTeX RDF	Sensor networks, coverage, protection
1	Constantinos Daskalakis, Christos H. Papadimitriou	Computing Equilibria in Anonymous Games.	FOCS	2007	DBLP DOI BibTeX RDF
1	My T. Thai, Feng Wang 0002, Dan Liu, Shiwei Zhu, Ding-Zhu Du	Connected Dominating Sets in Wireless Networks with Different Transmission Ranges.	IEEE Trans. Mob. Comput.	2007	DBLP DOI BibTeX RDF	disk graph, wireless network, Connected dominating set, independent set, virtual backbone
1	Volker Roth, Bernd Fischer	The kernelHMM : Learning Kernel Combinations in Structured Output Domains.	DAGM-Symposium	2007	DBLP DOI BibTeX RDF
1	Jiyang Dong, Junying Zhang, Zhong Chen	Neural Network Based Algorithm for Multi-Constrained Shortest Path Problem.	ISNN	2007	DBLP DOI BibTeX RDF
1	Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno	Efficient Algorithms for Airline Problem.	TAMC	2007	DBLP DOI BibTeX RDF	Airline problem, approximation algorithm, completeness, efficient algorithm
1	Sathish Govindarajan, Michael C. Dietze, Pankaj K. Agarwal, James S. Clark	A scalable algorithm for dispersing population.	J. Intell. Inf. Syst.	2007	DBLP DOI BibTeX RDF	Forest ecosystem, Ecological dispersal model, Forest simulation model, Approximation algorithms, Biodiversity
1	Piotr Krysta, Krzysztof Lorys	Efficient approximation algorithms for the achromatic number.	Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
1	Deepak Agarwal, Andrew McGregor, Jeff M. Phillips, Suresh Venkatasubramanian, Zhengyuan Zhu	Spatial scan statistics: approximations and performance study.	KDD	2006	DBLP DOI BibTeX RDF	Kulldorff scan statistic, discrepancy, spatial scan statistics
1	Olaf A. Hall-Holt, Matthew J. Katz, Piyush Kumar, Joseph S. B. Mitchell, Arik Sityon	Finding large sticks and potatoes in polygons.	SODA	2006	DBLP DOI BibTeX RDF
1	Chao Peng, Hong Shen	An Improved Approximation Algorithm for Computing Disjoint QoS Paths.	ICN/ICONS/MCL	2006	DBLP DOI BibTeX RDF
1	Joseph Y.-T. Leung, Hairong Zhao	Minimizing Sum of Completion Times and Makespan in Master-Slave Systems.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	Sequence and scheduling, approximation algorithms, linear programming, makespan
1	Boris Aronov, Sariel Har-Peled, Christian Knauer, Yusu Wang, Carola Wenk	Fréchet Distance for Curves, Revisited.	ESA	2006	DBLP DOI BibTeX RDF
1	Jan Arpe, Bodo Manthey	Approximability of Minimum AND-Circuits.	SWAT	2006	DBLP DOI BibTeX RDF
1	Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks	Approximating the Traffic Grooming Problem in Tree and Star Networks.	WG	2006	DBLP DOI BibTeX RDF	Optical Networks, Tree Networks, Traffic Grooming, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM)
1	Chengyu Sun, Nagender Bandi, Divyakant Agrawal, Amr El Abbadi	Exploring spatial datasets with histograms.	Distributed and Parallel Databases	2006	DBLP DOI BibTeX RDF	Databases, Geographic information systems, Query processing
1	Jason D. Hartline, Vladlen Koltun	Near-Optimal Pricing in Near-Linear Time.	WADS	2005	DBLP DOI BibTeX RDF
1	Tian-Shyr Dai, Guan-Shieng Huang, Yuh-Dauh Lyuu	Pricing Asian Options with an Efficient Convergent Approximation Algorithm.	WSTST	2005	DBLP DOI BibTeX RDF
1	Hans-Jakob Lüthi, Jörg Doege	Convex risk measures for portfolio optimization and concepts of flexibility.	Math. Program.	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991) 90A46, 52A41, 90A09, 90C25, 90C31
1	Xiaodong Wu, Danny Z. Chen, James J. Mason, Steven R. Schmid	Efficient approximation algorithms for pairwise data clustering and applications.	Int. J. Comput. Geometry Appl.	2004	DBLP DOI BibTeX RDF
1	Noga Alon, Assaf Naor	Approximating the cut-norm via Grothendieck's inequality.	STOC	2004	DBLP DOI BibTeX RDF	Grothendieck's inequaity, cut-norm, rounding techniques
1	Tian Bu, Samphel Norden, Thomas Y. C. Woo	Trading Resiliency for Security: Model and Algorithms.	ICNP	2004	DBLP DOI BibTeX RDF
1	Hu Zhang	Packing: Scheduling, Embedding, and Approximating Metrics.	ICCSA	2004	DBLP DOI BibTeX RDF
1	Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano	A Stochastic Location Problem with Applications to Tele-diagnostic.	WG	2004	DBLP DOI BibTeX RDF
1	John H. Reif, Zheng Sun	Movement Planning in the Presence of Flows.	Algorithmica	2004	DBLP DOI BibTeX RDF	Optimization, Robotics, Shortest path, Path planning
1	Mikkel Thorup	Quick and good facility location.	SODA	2003	DBLP DOI BibTeX RDF	efficient approximation algorithms, shortest paths, facility location
1	Sariel Har-Peled, Yusu Wang	Shape fitting with outliers.	Symposium on Computational Geometry	2003	DBLP DOI BibTeX RDF	approximation, outliers, shape fitting
1	Rudolf Berghammer, Markus Müller-Olm	Formal Development and Verification of Approximation Algorithms Using Auxiliary Variables.	LOPSTR	2003	DBLP DOI BibTeX RDF
1	Cristina Bazgan, Miklos Santha, Zsolt Tuza	Efficient Approximation Algorithms for the SUBSET-SUMS EQUALITY Problem.	J. Comput. Syst. Sci.	2002	DBLP DOI BibTeX RDF
1	Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe	Efficient approximation algorithms for the maximum weight matching problem.	ISCAS	2002	DBLP DOI BibTeX RDF
1	Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, Angela Y. Wu	A local search approximation algorithm for k-means clustering.	Symposium on Computational Geometry	2002	DBLP DOI BibTeX RDF	clustering, approximation algorithms, computational geometry, local search, k-means
1	Ming Li, Bin Ma, Lusheng Wang	On the closest string and substring problems.	J. ACM	2002	DBLP DOI BibTeX RDF	Closest string and substring, polynomial-time approximation scheme, computer applications
1	Chengyu Sun, Divyakant Agrawal, Amr El Abbadi	Exploring Spatial Datasets with Histograms.	ICDE	2002	DBLP DOI BibTeX RDF	query selectivity estimation, browsing, spatial databases
1	Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami	Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles.	J. Algorithms	2001	DBLP DOI BibTeX RDF
1	Binhai Zhu, Chung Keung Poon	Efficient Approximation Algorithms for Two-Label Point Labeling.	Int. J. Comput. Geometry Appl.	2001	DBLP BibTeX RDF
1	Yuri Boykov, Olga Veksler, Ramin Zabih	Fast Approximate Energy Minimization via Graph Cuts.	IEEE Trans. Pattern Anal. Mach. Intell.	2001	DBLP DOI BibTeX RDF	multiway cut, Markov Random Fields, graph algorithms, image restoration, motion, stereo, Energy minimization, maximum flow, minimum cut, early vision, Potts model
1	Luitpold Babel, Bo Chen, Hans Kellerer, Vladimir Kotov	On-Line Algorithms for Cardinality Constrained Bin Packing Problems.	ISAAC	2001	DBLP DOI BibTeX RDF	on-line, bin packing, cardinality constraint
1	John H. Reif, Zheng Sun	Movement Planning in the Presence of Flows.	WADS	2001	DBLP DOI BibTeX RDF
1	Johan Håstad	Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?	ICALP	2000	DBLP DOI BibTeX RDF
1	Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger	Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem.	CIAC	2000	DBLP DOI BibTeX RDF
1	David Liben-Nowell, Jon M. Kleinberg	Structural Properties and Tractability Results for Linear Synteny.	CPM	2000	DBLP DOI BibTeX RDF
1	Piotr Krysta, Krzysztof Lorys	Efficient Approximation Algorithms for the Achromatic Number.	ESA	1999	DBLP DOI BibTeX RDF
1	Leszek Gasieniec, Jesper Jansson, Andrzej Lingas	Efficient Approximation Algorithms for the Hamming Center Problem.	SODA	1999	DBLP DOI BibTeX RDF
1	Grégory Mounié, Christophe Rapine, Denis Trystram	Efficient Approximation Algorithms for Scheduling Malleable Tasks.	SPAA	1999	DBLP DOI BibTeX RDF
1	Binhai Zhu, Chung Keung Poon	Efficient Approximation Algorithms for Multi-label Map Labeling.	ISAAC	1999	DBLP DOI BibTeX RDF
1	Guoliang Xue, Guo-Hui Lin, Ding-Zhu Du	Grade of service Euclidean Steiner minimum trees.	ISCAS	1999	DBLP DOI BibTeX RDF
1	Dieter Kratsch, Lorna Stewart	Approximating Bandwidth by Mixing Layouts of Interval Graphs.	STACS	1999	DBLP DOI BibTeX RDF
1	Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp	On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees.	Algorithmica	1999	DBLP DOI BibTeX RDF	Approximation algorithms, Lower bounds, Evolutionary trees
1	Cristina Bazgan, Miklos Santha, Zsolt Tuza	Efficient Approximation Algorithms for the Subset-Sums Equality Problem.	ICALP	1998	DBLP DOI BibTeX RDF
1	Philip N. Klein, Hsueh-I Lu	Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs.	ISAAC	1998	DBLP DOI BibTeX RDF
1	Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi	Efficient Approximation Algorithms for Domatic Partition and on-line Coloring of Circular Arc Graphs.	Discrete Applied Mathematics	1996	DBLP DOI BibTeX RDF
1	Danny Z. Chen, Xiaobo Hu	Efficient Approximation Algorithms for Floorplan Area Minimization.	DAC	1996	DBLP DOI BibTeX RDF
1	Philip N. Klein, Hsueh-I Lu	Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING.	STOC	1996	DBLP DOI BibTeX RDF
1	Martin Sauerhoff, Ingo Wegener	On the complexity of minimizing the OBDD size for incompletely specified functions.	IEEE Trans. on CAD of Integrated Circuits and Systems	1996	DBLP DOI BibTeX RDF
1	Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi	Efficient Approximation Algorithms for Domatic Partition and On-Line Coloring of Circular Arc Graphs.	ICCI	1993	DBLP BibTeX RDF
1	Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi	The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract).	ICALP	1993	DBLP DOI BibTeX RDF
1	Joseph S. B. Mitchell, Subhash Suri	Separation and Approximation of Polyhedral Objects.	SODA	1992	DBLP DOI BibTeX RDF
1	Thang Nguyen Bui, Willie Hsu, SingLing Lee	A 2.5 approximation algorithm for the multi-via assignment problem.	IEEE Trans. on CAD of Integrated Circuits and Systems	1992	DBLP DOI BibTeX RDF
1	Edmund Ihler	Bounds on the quality of approximate solutions to the Group Steiner Problem.	WG	1990	DBLP DOI BibTeX RDF
1	Gabriele Reich, Peter Widmayer	Beyond Steiner's Problem: A VLSI Oriented Generalization.	WG	1989	DBLP DOI BibTeX RDF
1	Teofilo F. Gonzalez, Si-Qing Zheng	Bounds for partitioning rectilinear polygons.	Symposium on Computational Geometry	1985	DBLP DOI BibTeX RDF	approximation algrithms, partition of rectilinear polygons, polynomial time complexity