Search results for "Graph optimization problems"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Sashka Davis, Russell Impagliazzo	Models of Greedy Algorithms for Graph Problems.	Algorithmica	2009	DBLP DOI BibTeX RDF	Graph optimization problems, Greedy algorithms, Priority algorithms
2	Olivier Coudert	Solving graph optimization problems with ZBDDs.	ED&TC	1997	DBLP DOI BibTeX RDF
2	Guy Even, Joseph Naor, Satish Rao, Baruch Schieber	Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).	FOCS	1995	DBLP DOI BibTeX RDF	divide-and-conquer approximation algorithms, spreading metrics, NP-hard graph optimization problems, graph optimization problems, fractional spreading metric, fractional lengths, optimisation problem, spreading metric, interval graph completion, storage-time product, computational complexity, optimisation, directed graphs, directed graphs, polynomial time, vertices, divide and conquer methods, multicuts, polynomial time approximation algorithm
1	Allan Borodin, Joan Boyar, Kim S. Larsen, Nazanin Mirmohammadi	Priority algorithms for graph optimization problems.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Ei Ando, Hirotaka Ono, Masafumi Yamashita	A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems.	SAGA	2009	DBLP DOI BibTeX RDF
1	Farshad Safaei, Mahmood Fathy, Ahmad Khonsari, N. Talebanfard	On Disconnection Node Failure and Stochastic Static Resilience of P2P Communication Networks.	ICCSA	2007	DBLP DOI BibTeX RDF
1	Chien-Hung Liu, Yueh-Min Huang, Tzu-Chiang Chiang	A Near-optimal Multicast Scheme for Mobile Ad Hoc Networks Using a Hybrid Genetic Algorithm.	AINA	2006	DBLP DOI BibTeX RDF
1	Miroslav Chlebík, Janka Chlebíková	Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes.	SODA	2005	DBLP DOI BibTeX RDF
1	Allan Borodin, Joan Boyar, Kim S. Larsen	Priority Algorithms for Graph Optimization Problems.	WAOA	2004	DBLP DOI BibTeX RDF
1	Sashka Davis, Russell Impagliazzo	Models of greedy algorithms for graph problems.	SODA	2004	DBLP DOI BibTeX RDF
1	Spyros Angelopoulos	Order-Preserving Transformations and Greedy-Like Algorithms.	WAOA	2004	DBLP DOI BibTeX RDF	inapproximability results, facility location, dominating set, Priority algorithms
1	Ivan Basov, Alek Vainshtein	Approximation algorithms for multi-parameter graph optimization problems.	Discrete Applied Mathematics	2002	DBLP DOI BibTeX RDF
1	Guy Even, Joseph Naor, Satish Rao, Baruch Schieber	Divide-and-conquer approximation algorithms via spreading metrics.	J. ACM	2000	DBLP DOI BibTeX RDF	feedback set, spreading metrics, approximation algorithms, divide and conquer, multicut, linear arrangement
1	Moses Charikar, Chandra Chekuri, Ashish Goel, Sudipto Guha, Serge A. Plotkin	Approximating a Finite Metric by a Small Number of Tree Metrics.	FOCS	1998	DBLP DOI BibTeX RDF	probabilistic approximation of metric spaces, low diameter partitioning, real normed spaces, algorithms, linear programming, approximation, metric space, derandomization, tree metric
1	G. Dahl, Kurt Jörnsten, G. Løvnes, S. Svaet	Graph optimization problems in connection with the management of mobile communications systems.	Telecommunication Systems	1994	DBLP DOI BibTeX RDF
1	Bruce W. Weide	Random Graphs and Graph Optimization Problems.	SIAM J. Comput.	1980	DBLP DOI BibTeX RDF