18. SODA 2007:
New Orleans,
Louisiana,
USA
Nikhil Bansal, Kirk Pruhs, Clifford Stein (Eds.):
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007.
SIAM 2007, ISBN 978-0-898716-24-5 BibTeX
- Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson:
Region-fault tolerant geometric spanners.
1-10
Electronic Edition (ACM DL) BibTeX
- Joseph S. B. Mitchell:
A PTAS for TSP with neighborhoods among fat regions in the plane.
11-18
Electronic Edition (ACM DL) BibTeX
- Yoav Giyora, Haim Kaplan:
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions.
19-28
Electronic Edition (ACM DL) BibTeX
- David Eppstein:
Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition.
29-38
Electronic Edition (ACM DL) BibTeX
- Piotr Indyk:
A near linear time constant factor approximation for Euclidean bichromatic matching (cost).
39-42
Electronic Edition (ACM DL) BibTeX
- Robert D. Carr, Goran Konjevod, Greg Little, Venkatesh Natarajan, Ojas Parekh:
Compacting cuts: a new linear formulation for minimum cut.
43-52
Electronic Edition (ACM DL) BibTeX
- Wenceslas Fernandez de la Vega, Claire Kenyon-Mathieu:
Linear programming relaxations of maxcut.
53-61
Electronic Edition (ACM DL) BibTeX
- Moses Charikar, Konstantin Makarychev, Yury Makarychev:
Near-optimal algorithms for maximum constraint satisfaction problems.
62-68
Electronic Edition (ACM DL) BibTeX
- Qiaoming Han, Donglei Du, Juan Vera, Luis F. Zuluaga:
Improved bounds for the symmetric rendezvous value on the line.
69-78
Electronic Edition (ACM DL) BibTeX
- Fabián A. Chudak, Kiyohito Nagano:
Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization.
79-88
Electronic Edition (ACM DL) BibTeX
- Sergio Cabello, Erin W. Chambers:
Multiple source shortest paths in a genus g graph.
89-97
Electronic Edition (ACM DL) BibTeX
- Sergio Cabello, Günter Rote:
Obnoxious centers in graphs.
98-107
Electronic Edition (ACM DL) BibTeX
- Raphael Yuster, Uri Zwick:
Maximum matching in graphs with an excluded minor.
108-117
Electronic Edition (ACM DL) BibTeX
- Piotr Sankowski:
Faster dynamic matchings and vertex connectivity.
118-126
Electronic Edition (ACM DL) BibTeX
- Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi:
Efficient algorithms for computing all low s-t edge connectivities and related problems.
127-136
Electronic Edition (ACM DL) BibTeX
- Philippe Flajolet:
Analytic combinatorics: a calculus of discrete structures.
137-148
Electronic Edition (ACM DL) BibTeX
- Roee Engelberg, Joseph Naor:
Equilibria in online games.
149-158
Electronic Edition (ACM DL) BibTeX
- Xi Chen, Shang-Hua Teng, Paul Valiant:
The approximation complexity of win-lose games.
159-168
Electronic Edition (ACM DL) BibTeX
- Steve Chien, Alistair Sinclair:
Convergence to approximate Nash equilibria in congestion games.
169-178
Electronic Edition (ACM DL) BibTeX
- Amos Fiat, Yishay Mansour, Uri Nadav:
Efficient contention resolution protocols for selfish agents.
179-188
Electronic Edition (ACM DL) BibTeX
- Nir Andelman, Michal Feldman, Yishay Mansour:
Strong price of anarchy.
189-198
Electronic Edition (ACM DL) BibTeX
- Fei Li, Jay Sethuraman, Clifford Stein:
Better online buffer management.
199-208
Electronic Edition (ACM DL) BibTeX
- Matthias Englert, Matthias Westermann:
Considering suppressed packets improves buffer management in QoS switches.
209-218
Electronic Edition (ACM DL) BibTeX
- Matthew Andrews:
Instability of FIFO in the permanent sessions model at arbitrarily small network loads.
219-228
Electronic Edition (ACM DL) BibTeX
- Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz:
On the separation and equivalence of paging strategies.
229-237
Electronic Edition (ACM DL) BibTeX
- Julien Robert, Nicolas Schabanel:
Pull-based data broadcast with dependencies: be fair to users, not to items.
238-247
Electronic Edition (ACM DL) BibTeX
- Spyros Angelopoulos:
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry.
248-257
Electronic Edition (ACM DL) BibTeX
- Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam:
Minimizing movement.
258-267
Electronic Edition (ACM DL) BibTeX
- Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz:
Optimization problems in multiple-interval graphs.
268-277
Electronic Edition (ACM DL) BibTeX
- Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar:
Approximation algorithms via contraction decomposition.
278-287
Electronic Edition (ACM DL) BibTeX
- Kazuo Iwama, Shuichi Miyazaki, Naoya Yamauchi:
A 1.875: approximation algorithm for the stable marriage problem.
288-297
Electronic Edition (ACM DL) BibTeX
- Jianer Chen, Songjian Lu, Sing-Hoi Sze, Fenghui Zhang:
Improved algorithms for path, matching, and packing problems.
298-307
Electronic Edition (ACM DL) BibTeX
- Sudipto Guha, Kamesh Munagala:
Model-driven optimization using adaptive probes.
308-317
Electronic Edition (ACM DL) BibTeX
- Parikshit Gopalan, T. S. Jayram, Robert Krauthgamer, Ravi Kumar:
Estimating the sortedness of a data stream.
318-327
Electronic Edition (ACM DL) BibTeX
- Amit Chakrabarti, Graham Cormode, Andrew McGregor:
A near-optimal algorithm for computing the entropy of a stream.
328-335
Electronic Edition (ACM DL) BibTeX
- Xiaoming Sun, David P. Woodruff:
The communication and streaming complexity of computing the longest common and increasing subsequences.
336-345
Electronic Edition (ACM DL) BibTeX
- T. S. Jayram, Satyen Kale, Erik Vee:
Efficient aggregation algorithms for probabilistic data.
346-355
Electronic Edition (ACM DL) BibTeX
- Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske:
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling.
356-365
Electronic Edition (ACM DL) BibTeX
- Mickey Brautbar, Alex Samorodnitsky:
Approximating entropy from sublinear samples.
366-375
Electronic Edition (ACM DL) BibTeX
- David Galvin, Dana Randall:
Torpid mixing of local Markov chains on 3-colorings of the discrete torus.
376-384
Electronic Edition (ACM DL) BibTeX
- Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright:
Probabilistic analysis of linear programming decoding.
385-394
Electronic Edition (ACM DL) BibTeX
- Adam Smith:
Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes.
395-404
Electronic Edition (ACM DL) BibTeX
- Anke van Zuylen, Rajneesh Hegde, Kamal Jain, David P. Williamson:
Deterministic pivoting algorithms for constrained ranking and clustering problems.
405-414
Electronic Edition (ACM DL) BibTeX
- Nir Ailon:
Aggregation of partial rankings, p-ratings and top-m lists.
415-424
Electronic Edition (ACM DL) BibTeX
- Rajat Bhattacharjee, Ashish Goel:
Algorithms and incentives for robust ranking.
425-433
Electronic Edition (ACM DL) BibTeX
- Moshe Babaioff, Nicole Immorlica, Robert Kleinberg:
Matroids, secretary problems, and online mechanisms.
434-443
Electronic Edition (ACM DL) BibTeX
- Nicholas J. A. Harvey:
An algebraic algorithm for weighted linear matroid intersection.
444-453
Electronic Edition (ACM DL) BibTeX
- Noga Alon, Oded Schwartz, Asaf Shapira:
An elementary construction of constant-degree expanders.
454-458
Electronic Edition (ACM DL) BibTeX
- Daniel Fernholz, Vijaya Ramachandran:
The k-orientability thresholds for Gn, p.
459-468
Electronic Edition (ACM DL) BibTeX
- Julie Anne Cain, Peter Sanders, Nicholas C. Wormald:
The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation.
469-476
Electronic Edition (ACM DL) BibTeX
- Graham Brightwell, Konstantinos Panagiotou, Angelika Steger:
On extremal subgraphs of random graphs.
477-485
Electronic Edition (ACM DL) BibTeX
- Martin Marciniszyn, Reto Spöhel:
Online vertex colorings of random graphs without monochromatic subgraphs.
486-493
Electronic Edition (ACM DL) BibTeX
- Artur Czumaj, Christian Sohler:
On testable properties in bounded degree graphs.
494-501
Electronic Edition (ACM DL) BibTeX
- Ittai Abraham, Yair Bartal, Ofer Neiman:
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion.
502-511
Electronic Edition (ACM DL) BibTeX
- Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos:
Approximation algorithms for embedding general metrics into trees.
512-521
Electronic Edition (ACM DL) BibTeX
- Nariankadu D. Shyamalkumar, Kasturi Varadarajan:
Efficient subspace approximation algorithms.
532-540
Electronic Edition (ACM DL) BibTeX
- Moses Charikar, Konstantin Makarychev, Yury Makarychev:
A divide and conquer algorithm for d-dimensional arrangement.
541-546
Electronic Edition (ACM DL) BibTeX
- Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano:
Resilient search trees.
547-553
Electronic Edition (ACM DL) BibTeX
- Mihai Patrascu, Mikkel Thorup:
Randomization does not help searching predecessors.
555-564
Electronic Edition (ACM DL) BibTeX
- Tsvi Kopelowitz, Moshe Lewenstein:
Dynamic weighted ancestors.
565-574
Electronic Edition (ACM DL) BibTeX
- Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
Ultra-succinct representation of ordered trees.
575-584
Electronic Edition (ACM DL) BibTeX
- Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang:
Tree exploration with logarithmic memory.
585-594
Electronic Edition (ACM DL) BibTeX
- Maria Chudnovsky, Paul D. Seymour:
Testing for a theta.
595-598
Electronic Edition (ACM DL) BibTeX
- Amnon Ta-Shma, Uri Zwick:
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences.
599-608
Electronic Edition (ACM DL) BibTeX
- Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem:
Planar graphs are in 1-STRING.
609-617
Electronic Edition (ACM DL) BibTeX
- Julia Böttcher, Mathias Schacht, Anusch Taraz:
On the bandwidth conjecture for 3-colourable graphs.
618-626
Electronic Edition (ACM DL) BibTeX
- László Babai, Igor Gorodezky:
Sandpile transience on the grid is polynomially bounded.
627-636
Electronic Edition (ACM DL) BibTeX
- Paul Hunter, Stephan Kreutzer:
Digraph measures: Kelly decompositions, games, and orderings.
637-644
Electronic Edition (ACM DL) BibTeX
- C. Thach Nguyen, Jian Shen, Minmei Hou, Li Sheng, Webb Miller, Louxin Zhang:
Approximating the spanning star forest problem and its applications to genomic sequence alignment.
645-654
Electronic Edition (ACM DL) BibTeX
- Jing Xiao, Lan Liu, Lirong Xia, Tao Jiang:
Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree.
655-664
Electronic Edition (ACM DL) BibTeX
- Max A. Alekseyev, Pavel A. Pevzner:
Whole genome duplications, multi-break rearrangements, and genome halving problem.
665-679
Electronic Edition (ACM DL) BibTeX
- Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao:
Succinct indexes for strings, binary relations and multi-labeled trees.
680-689
Electronic Edition (ACM DL) BibTeX
- Paolo Ferragina, Rossano Venturini:
A simple storage scheme for strings achieving entropy bounds.
690-696
Electronic Edition (ACM DL) BibTeX
- Eyal Even-Dar, Michael Kearns, Siddharth Suri:
A network formation game for bipartite exchange economies.
697-706
Electronic Edition (ACM DL) BibTeX
- Ning Chen, Anna R. Karlin:
Cheap labor can be expensive.
707-715
Electronic Edition (ACM DL) BibTeX
- Patrick Briest, Piotr Krysta:
Buying cheap is expensive: hardness of non-parametric multi-product pricing.
716-725
Electronic Edition (ACM DL) BibTeX
- Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko:
Dynamic pricing for impatient bidders.
726-735
Electronic Edition (ACM DL) BibTeX
- Edith Elkind:
Designing and learning optimal finite support auctions.
736-745
Electronic Edition (ACM DL) BibTeX
- Frank Nielsen, Jean-Daniel Boissonnat, Richard Nock:
On Bregman Voronoi diagrams.
746-755
Electronic Edition (ACM DL) BibTeX
- Tetsuo Asano, Jirí Matousek, Takeshi Tokuyama:
Zone diagrams: existence, uniqueness and algorithmic challenge.
756-765
Electronic Edition (ACM DL) BibTeX
- Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang:
Approximate shortest paths in anisotropic regions.
766-774
Electronic Edition (ACM DL) BibTeX
- Liam Roditty, Michael Segal:
On bounded leg shortest paths problems.
775-784
Electronic Edition (ACM DL) BibTeX
- Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin:
Counting colors in boxes.
785-794
Electronic Edition (ACM DL) BibTeX
- Ho-Leung Chan, Wun-Tat Chan, Tak Wah Lam, Lap-Kei Lee, Kin-Sum Mak, Prudence W. H. Wong:
Energy efficient online deadline scheduling.
795-804
Electronic Edition (ACM DL) BibTeX
- Nikhil Bansal, Kirk Pruhs, Clifford Stein:
Speed scaling for weighted flow time.
805-813
Electronic Edition (ACM DL) BibTeX
- James Aspnes, Yang Richard Yang, Yitong Yin:
Path-independent load balancing with unreliable machines.
814-823
Electronic Edition (ACM DL) BibTeX
- Qingbo Cai, Vincenzo Liberatore:
Layered multicast scheduling for the Linfinity objective.
824-833
Electronic Edition (ACM DL) BibTeX
- Wei-Lung Dustin Tseng, David Kirkpatrick:
Lower bounds on average-case delay for video-on-demand broadcast protocols.
834-842
Electronic Edition (ACM DL) BibTeX
- Jan M. Hochstein, Karsten Weihe:
Maximum s-t-flow with k crossings in O(k3n log n) time.
843-847
Electronic Edition (ACM DL) BibTeX
- Günter Rote, Martin Zachariasen:
Matrix scaling by network flow.
848-854
Electronic Edition (ACM DL) BibTeX
- Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman:
Single source multiroute flows and cuts on uniform capacity networks.
855-863
Electronic Edition (ACM DL) BibTeX
- Andrew McGregor, Bruce Shepherd:
Island hopping and path colouring with applications to WDM network design.
864-873
Electronic Edition (ACM DL) BibTeX
- Vadim V. Lozin, Martin Milanic:
Maximum independent sets in graphs of low degree.
874-880
Electronic Edition (ACM DL) BibTeX
- Richard M. Karp, Robert Kleinberg:
Noisy binary search and its applications.
881-890
Electronic Edition (ACM DL) BibTeX
- Luc Devroye, Gábor Lugosi, GaHyun Park, Wojciech Szpankowski:
Multiple choice tries and distributed hash tables.
891-899
Electronic Edition (ACM DL) BibTeX
- Milan Ruzic:
Making deterministic signatures quickly.
900-909
Electronic Edition (ACM DL) BibTeX
- Luca Allulli, Peter Lichodzijewski, Norbert Zeh:
A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths.
910-919
Electronic Edition (ACM DL) BibTeX
- Liam Roditty:
On the K-simple shortest paths problem in weighted directed graphs.
920-928
Electronic Edition (ACM DL) BibTeX
- Mohammad Taghi Hajiaghayi, Robert Kleinberg, Tom Leighton:
Semi-oblivious routing: lower bounds.
929-938
Electronic Edition (ACM DL) BibTeX
- Goran Konjevod, Andréa W. Richa, Donglin Xia:
Optimal scale-free compact routing schemes in networks of low doubling dimension.
939-948
Electronic Edition (ACM DL) BibTeX
- Baruch Awerbuch, Rohit Khandekar, Satish Rao:
Distributed algorithms for multicommodity flow problems via approximate steepest descent framework.
949-957
Electronic Edition (ACM DL) BibTeX
- Stefan Funke, Nikola Milosavljevic:
Network sketching or: "How Much Geometry Hides in Connectivity?--Part II".
958-967
Electronic Edition (ACM DL) BibTeX
- Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany:
Line-of-sight networks.
968-977
Electronic Edition (ACM DL) BibTeX
- Asaf Shapira, Raphael Yuster, Uri Zwick:
All-pairs bottleneck paths in vertex weighted graphs.
978-985
Electronic Edition (ACM DL) BibTeX
- Artur Czumaj, Andrzej Lingas:
Finding a heaviest triangle is not harder than matrix multiplication.
986-994
Electronic Edition (ACM DL) BibTeX
- Ryan Williams:
Matrix-vector multiplication in sub-quadratic time: (some preprocessing required).
995-1001
Electronic Edition (ACM DL) BibTeX
- Ioannis Koutis, Gary L. Miller:
A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians.
1002-1011
Electronic Edition (ACM DL) BibTeX
- Alin Bostan, Frédéric Chyzak, F. Ollivier, Bruno Salvy, Éric Schost, Alexandre Sedoglavic:
Fast computation of power series solutions of systems of differential equations.
1012-1021
Electronic Edition (ACM DL) BibTeX
- Monika Rauch Henzinger:
Combinatorial algorithms for web search engines: three success stories.
1022-1026
Electronic Edition (ACM DL) BibTeX
- David Arthur, Sergei Vassilvitskii:
k-means++: the advantages of careful seeding.
1027-1035
Electronic Edition (ACM DL) BibTeX
- Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra:
Spectral clustering with limited independence.
1036-1045
Electronic Edition (ACM DL) BibTeX
- Kamalika Chaudhuri, Eran Halperin, Satish Rao, Shuheng Zhou:
A rigorous analysis of population stratification with limited data.
1046-1055
Electronic Edition (ACM DL) BibTeX
- Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi:
Restricted strip covering and the sensor cover problem.
1056-1063
Electronic Edition (ACM DL) BibTeX
- David Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang:
Compressing rectilinear pictures and minimizing access control lists.
1066-1075
Electronic Edition (ACM DL) BibTeX
- Leonidas J. Guibas, Steve Oudot:
Reconstruction using witness complexes.
1076-1085
Electronic Edition (ACM DL) BibTeX
- Edgar A. Ramos, Bardia Sadri:
Geometric and topological guarantees for the WRAP reconstruction algorithm.
1086-1095
Electronic Edition (ACM DL) BibTeX
- Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos:
Delaunay refinement for piecewise smooth complexes.
1096-1105
Electronic Edition (ACM DL) BibTeX
- Nina Amenta, Dominique Attali, Olivier Devillers:
Complexity of Delaunay triangulation for points on lower-dimensional polyhedra.
1106-1113
Electronic Edition (ACM DL) BibTeX
- Adrian Dumitrescu, Csaba D. Tóth:
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space.
1114-1123
Electronic Edition (ACM DL) BibTeX
- Ravi Kannan, Thorsten Theobald:
Games of fixed rank: a hierarchy of bimatrix games.
1124-1132
Electronic Edition (ACM DL) BibTeX
- Chaitanya Swamy:
The effectiveness of Stackelberg strategies and tolls for network congestion games.
1133-1142
Electronic Edition (ACM DL) BibTeX
- Ahuva Mu'alem, Michael Schapira:
Setting lower bounds on truthfulness: extended abstract.
1143-1152
Electronic Edition (ACM DL) BibTeX
- Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer:
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem.
1153-1162
Electronic Edition (ACM DL) BibTeX
- George Christodoulou, Elias Koutsoupias, Angelina Vidali:
A lower bound for scheduling mechanisms.
1163-1170
Electronic Edition (ACM DL) BibTeX
- Satoru Iwata, Kenjiro Takazawa:
The independent even factor problem.
1171-1180
Electronic Edition (ACM DL) BibTeX
- Yuji Matsuoka:
Fractional packing in ideal clutters.
1181-1186
Electronic Edition (ACM DL) BibTeX
- Ken-ichi Kawarabayashi:
Half integral packing, Erdős-Posá-property and graph minors.
1187-1196
Electronic Edition (ACM DL) BibTeX
- Nikhil Bansal, Xin Han, Kazuo Iwama, Maxim Sviridenko, Guochuan Zhang:
Harmonic algorithm for 3-dimensional strip packing problem.
1197-1206
Electronic Edition (ACM DL) BibTeX
- David Karger, Krzysztof Onak:
Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems.
1207-1216
Electronic Edition (ACM DL) BibTeX
- Gorjan Alagic, Cristopher Moore, Alexander Russell:
Quantum algorithms for Simon's problem over general groups.
1217-1224
Electronic Edition (ACM DL) BibTeX
- Andrew M. Childs, Wim van Dam:
Quantum algorithm for a generalized hidden shift problem.
1225-1232
Electronic Edition (ACM DL) BibTeX
- Dave Bacon, Isaac L. Chuang, Aram Wettroth Harrow:
The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits.
1235-1244
Electronic Edition (ACM DL) BibTeX
- David Gamarnik, Dmitriy Katz:
Correlation decay and deterministic FPTAS for counting list-colorings of a graph.
1245-1254
Electronic Edition (ACM DL) BibTeX
- Andrea Montanari, Devavrat Shah:
Counting good truth assignments of random k-SAT formulae.
1255-1264
Electronic Edition (ACM DL) BibTeX
- Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour:
Approximation algorithms for node-weighted buy-at-bulk network design.
1265-1274
Electronic Edition (ACM DL) BibTeX
- Yogeshwer Sharma, Chaitanya Swamy, David P. Williamson:
Approximation algorithms for prize collecting forest problems with submodular penalty functions.
1275-1284
Electronic Edition (ACM DL) BibTeX
- Glencora Borradaile, Claire Kenyon-Mathieu, Philip N. Klein:
A polynomial-time approximation scheme for Steiner tree in planar graphs.
1285-1294
Electronic Edition (ACM DL) BibTeX
- Matthias Englert, Heiko Röglin, Berthold Vöcking:
Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP: extended abstract.
1295-1304
Electronic Edition (ACM DL) BibTeX
- Aravind Srinivasan:
Approximation algorithms for stochastic and risk-averse optimization.
1305-1313
Electronic Edition (ACM DL) BibTeX
DBLP:
[Home | Search: Author, Title | Conferences | Journals]
Copyright © Sat Dec 22 20:25:23 2007
by Michael Ley (ley@uni-trier.de)