Loading
Error: Cannot Load Popup Box
Skip to hit list
Adjust your hit list
Further result pages
Mobile

A
A
A

A

English
Deutsch
Français
Español
Polski
Ελληνικά
Українська
中文
 Logged in as

Log Out

Login
BASIC
SEARCH
ADVANCED
SEARCH
HELP
BROWSING
SEARCH
HISTORY
Your search
Search For:
Entire Document
Title
Author
Subject
Boost open access documents
Find
Linguistics tools
Verbatim search
Additional word forms
Multilingual synonyms
Statistics
1,579 hits
in 72,045,933 documents
in 0.72 seconds
Please leave the following field blank:
Home
»
Search: K. Fleischer
Hit List
Hit list
1.
Approximating fractional multicommodity flow independent of the number of commodities
Open Access
Title:
Approximating fractional multicommodity flow independent of the number of commodities
Author:
Lisa K. Fleischer
Lisa K. Fleischer
Minimize authors
Description:
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation scheme for maximum multicommodity flow that is independent of the number of commodities k, and our algorithm improves upon the runtime of previous algorithms by this ...
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation scheme for maximum multicommodity flow that is independent of the number of commodities k, and our algorithm improves upon the runtime of previous algorithms by this factor of k, running in O ∗ (ɛ −2 m 2) time. For maximum concurrent flow, and minimum cost concurrent flow, we present algorithms that are faster than the current known algorithms when the graph is sparse or the number of commodities k is large, i.e. k> m/n. Our algorithms build on the framework proposed by Garg and Könemann in FOCS 1998. They are simple, deterministic, and for the versions without costs, they are strongly polynomial. The approximation guarantees are obtained by comparison with dual feasible solutions found by our algorithm. Our maximum multicommodity flow algorithm extends to an approximation scheme for the maximum weighted multicommodity flow, which is faster than those implied by previous algorithms by a factor of k / log W where W is the maximum weight of a commodity. Key words. multicommodity flow, approximation algorithm, concurrent flow, VLSI routing
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090322
Source:
http://www.cs.dartmouth.edu/~lkf/papers/lpmulti.pdf
http://www.cs.dartmouth.edu/~lkf/papers/lpmulti.pdf
Minimize
Document Type:
text
Language:
en
DDC:
518 Numerical analysis
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.8312
http://www.cs.dartmouth.edu/~lkf/papers/lpmulti.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.8312
http://www.cs.dartmouth.edu/~lkf/papers/lpmulti.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
2.
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
Open Access
Title:
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
Author:
Lisa K. Fleischer
Lisa K. Fleischer
Minimize authors
Description:
We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation scheme for maximum multicommodity flow that is independent of the number of commodities k, and our algorithm improves upon the runtime of previous algorithms by this factor of ...
We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation scheme for maximum multicommodity flow that is independent of the number of commodities k, and our algorithm improves upon the runtime of previous algorithms by this factor of k, performing in O (ffl \Gamma2 m 2 ) time. For maximum concurrent flow, and minimum cost concurrent flow, we present algorithms that are faster than the current known algorithms when the graph is sparse or the number of commodities k is large, i.e. k ? m=n. Our algorithms build on the framework proposed by Garg and Konemann [4]. They are simple, deterministic, and for the versions without costs, they are strongly polynomial. Our maximum multicommodity flow algorithm extends to an approximation scheme for the maximum weighted multicommodity flow, which is faster than those implied by previous algorithms by a factor of k= log W where W is .
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090413
Source:
http://www.ieor.columbia.edu/~lisa/papers/multi5.ps
http://www.ieor.columbia.edu/~lisa/papers/multi5.ps
Minimize
Document Type:
text
Language:
en
DDC:
518 Numerical analysis
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5690
http://www.ieor.columbia.edu/~lisa/papers/multi5.ps
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5690
http://www.ieor.columbia.edu/~lisa/papers/multi5.ps
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
3.
A Fast Approximation Scheme for Fractional Covering Problems with Box Constraints
Open Access
Title:
A Fast Approximation Scheme for Fractional Covering Problems with Box Constraints
Author:
Lisa K. Fleischer
Lisa K. Fleischer
Minimize authors
Description:
We present the first combinatorial approximation scheme that yields a pure approximation guarantee for linear programs that are either covering problems with upper bounds on variables, or their duals. Existing approximation schemes for mixed covering and packing problems do not simultaneously satisfy packing and covering constraints exactly. We ...
We present the first combinatorial approximation scheme that yields a pure approximation guarantee for linear programs that are either covering problems with upper bounds on variables, or their duals. Existing approximation schemes for mixed covering and packing problems do not simultaneously satisfy packing and covering constraints exactly. We present the first combinatorial approximation scheme that returns solutions that simultaneously satisfy general positive covering constraints and upper bounds on variable values. For input parameter ffl? 0, the returned solution has positive linear objective function value at most 1 + ffl times the optimal value. The general algorithm requires O(ffl2m log(cTu)) iterations, where c is the objective cost vector, u is the vector of upper bound values, and m is the number of variables. Each iteration uses an oracle that finds an (approximately) most violated constraint. A natural set of problems that our work addresses are linear programs for various network design problems: generalized Steiner network, vertex connectivity, directed connectivity, capacitated network design, group Steiner forest. The integer versions of these problems are all NPhard. For each of them, there is an approximation algorithm that rounds the solution to the corresponding linear program relaxation. If the LP solution is not feasible, then the corresponding integer solution will also not be feasible. Solving the linear program is often the computational bottleneck in these problems, and thus a fast approximation scheme for the LP relaxation means faster approximation algorithms. For these applications, we introduce a new modification of the pushrelabel maximum flow algorithm that allows us to perform each iteration in amortized O(jEj+jV j log jV j) time, instead of one maximum flow per iteration that is implied by the straight forward adaptation of our general algorithm. In conjunction with an observation that reduces the number of iterations to jEj log jV j for f0; 1g constraint matrices, the modification allows us to obtain an algorithm that is faster than existing exact or approximate algorithms by a factor of at least O(jEj) and by a factor of O(jEj log jV j) if the number of demand pairs is \Omega (jV j).
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090119
Source:
http://www.cs.dartmouth.edu/~lkf/papers/lpjournal.ps.gz
http://www.cs.dartmouth.edu/~lkf/papers/lpjournal.ps.gz
Minimize
Document Type:
text
Language:
en
DDC:
518 Numerical analysis
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.3622
http://www.cs.dartmouth.edu/~lkf/papers/lpjournal.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.3622
http://www.cs.dartmouth.edu/~lkf/papers/lpjournal.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
4.
Quickest flows over time
Open Access
Title:
Quickest flows over time
Author:
Lisa K. Fleischer
;
Lisa Fleischer
;
Martin Skutella
;
Martin Skutella
Lisa K. Fleischer
;
Lisa Fleischer
;
Martin Skutella
;
Martin Skutella
Minimize authors
Description:
LIMITED DISTRIBUTION NOTICE: This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research
LIMITED DISTRIBUTION NOTICE: This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090106
Source:
http://domino.watson.ibm.com/library/cyberdig.nsf/papers/49E00CD15329768985256D5D00516387/$File/RC22833.pdf
http://domino.watson.ibm.com/library/cyberdig.nsf/papers/49E00CD15329768985256D5D00516387/$File/RC22833.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.6657
http://domino.watson.ibm.com/library/cyberdig.nsf/papers/49E00CD15329768985256D5D00516387/$File/R...
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.6657
http://domino.watson.ibm.com/library/cyberdig.nsf/papers/49E00CD15329768985256D5D00516387/$File/R...
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
5.
A DivideAndConquer Algorithm For Identifying Strongly Connected Components
Open Access
Title:
A DivideAndConquer Algorithm For Identifying Strongly Connected Components
Author:
Lisa K. Fleischer
;
Bruce Hendrickson
;
Ali Pinar
Lisa K. Fleischer
;
Bruce Hendrickson
;
Ali Pinar
Minimize authors
Description:
The standard serial algorithm for strongly connected components has linear complexity and is based on depth first search. Unfortunately, depth first search is difficult to parallelize. We describe a divideandconquer algorithm for this problem which has significantly greater potential for parallelization. We show the expected serial running tim...
The standard serial algorithm for strongly connected components has linear complexity and is based on depth first search. Unfortunately, depth first search is difficult to parallelize. We describe a divideandconquer algorithm for this problem which has significantly greater potential for parallelization. We show the expected serial running time of our algorithm to be O(E log V). We also present a variant of our algorithm that has O(E log V) worstcase complexity.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20140107
Source:
ftp://ftp.cs.sandia.gov/pub/papers/bahendr/scc_theory.ps.gz
ftp://ftp.cs.sandia.gov/pub/papers/bahendr/scc_theory.ps.gz
Minimize
Document Type:
text
Language:
en
Subjects:
ordinates
ordinates
Minimize
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.2396
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.2396
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
6.
Simple sybilproof mechanisms for multilevel marketing. www.cs.dartmouth.edu/ druckerf/papers/sybilabstract.pdf
Open Access
Title:
Simple sybilproof mechanisms for multilevel marketing. www.cs.dartmouth.edu/ druckerf/papers/sybilabstract.pdf
Author:
Fabio A. Drucker
;
Lisa K. Fleischer
;
Dartmouth College
Fabio A. Drucker
;
Lisa K. Fleischer
;
Dartmouth College
Minimize authors
Description:
Multilevel marketing refers to a marketing approach in which buyers are encouraged to take an active role in promoting the product. This is done by offering them a reward for each successful referral of the product to other prospective buyers. To encourage potential customers to buy early and to give referrals to influential people, these mecha...
Multilevel marketing refers to a marketing approach in which buyers are encouraged to take an active role in promoting the product. This is done by offering them a reward for each successful referral of the product to other prospective buyers. To encourage potential customers to buy early and to give referrals to influential people, these mechanisms also reward indirect referrals — a direct referral linked to the buyer through other direct referrals. Doing so can make the referral/reward system vulnerable to sybil attacks — where profit maximizers create several replicas in order to maximize their rewards. In this paper we propose a family of mechanisms for which sybil attacks are not profitable. We do this by modifyinganymechanism thatsatisfiescertain natural properties of sensiblereward mechanismsto obtain one that is invulnerable to sybil attacks by profit maximizers while preserving its natural properties. Our modified mechanisms are also collusion proof. Finally, we give a concrete example of a natural mechanism that is sybil proof and simple to implement.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20130719
Source:
http://www.cs.dartmouth.edu/~lkf/papers/fabioec12.pdf
http://www.cs.dartmouth.edu/~lkf/papers/fabioec12.pdf
Minimize
Document Type:
text
Language:
en
Subjects:
Categories and Subject Descriptors ; J.4 [Social and Behavioral Sciences ; Economics ; G.2.2 [Discrete Mathematics ; Graph Theory—Network problems General Terms ; Algorithms ; Economics Additional Key Words and Phrases ; Mechanism design ; Recommender systems ; Social networks
Categories and Subject Descriptors ; J.4 [Social and Behavioral Sciences ; Economics ; G.2.2 [Discrete Mathematics ; Graph Theory—Network problems General Terms ; Algorithms ; Economics Additional Key Words and Phrases ; Mechanism design ; Recommender systems ; Social networks
Minimize
DDC:
303 Social processes
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.1601
http://www.cs.dartmouth.edu/~lkf/papers/fabioec12.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.1601
http://www.cs.dartmouth.edu/~lkf/papers/fabioec12.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
7.
On Identifying Strongly Connected Components in Parallel
Open Access
Title:
On Identifying Strongly Connected Components in Parallel
Author:
Lisa K. Fleischer
;
Bruce Hendrickson
;
Ali Pinar
Lisa K. Fleischer
;
Bruce Hendrickson
;
Ali Pinar
Minimize authors
Description:
. The standard serial algorithm for strongly connected components is based on depth first search, which is difficult to parallelize. We describe a divideandconquer algorithm for this problem which has significantly greater potential for parallelization. For a graph with n vertices in which degrees are bounded by a constant, we show the expecte...
. The standard serial algorithm for strongly connected components is based on depth first search, which is difficult to parallelize. We describe a divideandconquer algorithm for this problem which has significantly greater potential for parallelization. For a graph with n vertices in which degrees are bounded by a constant, we show the expected serial running time of our algorithm to be O(n log n). 1 Introduction A strongly connected component of a directed graph is a maximal subset of vertices containing a directed path from each vertex to all others in the subset. The vertices of any directed graph can be partitioned into a set of disjoint strongly connected components. This decomposition is a fundamental tool in graph theory with applications in compiler analysis, data mining, scientific computing and other areas. The definitive serial algorithm for identifying strongly connected components is due to Tarjan [15] and is built on a depth first search of the graph. For a grap.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090413
Source:
http://www.cse.uiuc.edu/~alipinar/papers/irreg00.ps
http://www.cse.uiuc.edu/~alipinar/papers/irreg00.ps
Minimize
Document Type:
text
Language:
en
DDC:
511 General principles of mathematics
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.6322
http://www.cse.uiuc.edu/~alipinar/papers/irreg00.ps
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.6322
http://www.cse.uiuc.edu/~alipinar/papers/irreg00.ps
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
8.
Optimal Rounding of Instantaneous Fractional Flows Over Time
Open Access
Title:
Optimal Rounding of Instantaneous Fractional Flows Over Time
Author:
Lisa K. Fleischer
;
James B. Orlin
Lisa K. Fleischer
;
James B. Orlin
Minimize authors
Description:
A transshipment problem with demands that exceed network capacity can be solved by sending flow in several waves. How can this be done in the minimum number, T, of waves, and at minimum cost, if costs are piecewise linear convex functions of the flow? In this paper, we show that this problem can be solved using $\min\{ m,\log T,\ub{\Gamma}{U} \}...
A transshipment problem with demands that exceed network capacity can be solved by sending flow in several waves. How can this be done in the minimum number, T, of waves, and at minimum cost, if costs are piecewise linear convex functions of the flow? In this paper, we show that this problem can be solved using $\min\{ m,\log T,\ub{\Gamma}{U} \}$ maximum flow computations and one minimum (convex) cost flow computation. Here m is the number of arcs, $\Gamma$ is the maximum supply or demand, and U is the maximum capacity. When there is only one sink, this problem can be solved in the same asymptotic time as one minimum (convex) cost flow computation. This improves upon the previous best algorithm to solve the problem without costs by a factor of k. Our solutions start with a stationary fractional flow and use rounding to transform this into an integral flow. The rounding procedure takes O(n) time.
Minimize
Publisher:
Society for Industrial and Applied Mathematics
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090731
Source:
http://web.mit.edu/jorlin/www/papersfolder/Rounding_Flows.pdf
http://web.mit.edu/jorlin/www/papersfolder/Rounding_Flows.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.7210
http://web.mit.edu/jorlin/www/papersfolder/Rounding_Flows.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.7210
http://web.mit.edu/jorlin/www/papersfolder/Rounding_Flows.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
9.
Fast and simple approximation schemes for generalized flow
Open Access
Title:
Fast and simple approximation schemes for generalized flow
Author:
Lisa K. Fleischer
;
Kevin D. Wayne
Lisa K. Fleischer
;
Kevin D. Wayne
Minimize authors
Description:
We present fast and simple fully.
We present fast and simple fully.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090119
Source:
http://www.cs.dartmouth.edu/~lkf/papers/genflow.pdf
http://www.cs.dartmouth.edu/~lkf/papers/genflow.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.6314
http://www.cs.dartmouth.edu/~lkf/papers/genflow.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.6314
http://www.cs.dartmouth.edu/~lkf/papers/genflow.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
10.
Optimal Rounding of Instantaneous Fractional Flows Over Time
Open Access
Title:
Optimal Rounding of Instantaneous Fractional Flows Over Time
Author:
Lisa K. Fleischer
;
James B. Orlin
Lisa K. Fleischer
;
James B. Orlin
Minimize authors
Description:
A transshipment problem with demands that exceed network capacity can be solved by sending flow in several waves. How can this be done in the minimum number, T, of waves, and at minimum cost, if costs are piecewise linear convex functions of the flow? In this paper, we show that this problem can be solved using min{m,logT, l+og(mu)g(U)} maximu...
A transshipment problem with demands that exceed network capacity can be solved by sending flow in several waves. How can this be done in the minimum number, T, of waves, and at minimum cost, if costs are piecewise linear convex functions of the flow? In this paper, we show that this problem can be solved using min{m,logT, l+og(mu)g(U)} maximum flow computations and one minimum (convex) cost flow computation. Here m is the number of arcs, F is the maximum supply or demand, and U is the maximum capacity. When there is only one sink, this problem can be solved in the same asymptotic time as one minimum (convex) cost flow computation. This improves upon the recent algorithm in [5] which solves the quickest transshipment problem (the above mentioned problem without costs) on k terminals using k logT maximum flow computations and k minimum cost flow computations. Our solutions start with a stationary fractional flow, as described in [5], and use rounding to transform this into an integral flow. The rounding procedure takes O(n) time.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20110803
Source:
http://dspace.mit.edu/bitstream/1721.1/5118/1/OR3409946439172.pdf
http://dspace.mit.edu/bitstream/1721.1/5118/1/OR3409946439172.pdf
Minimize
Document Type:
text
Language:
en
DDC:
532 Fluid mechanics; liquid mechanics
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.4047
http://dspace.mit.edu/bitstream/1721.1/5118/1/OR3409946439172.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.4047
http://dspace.mit.edu/bitstream/1721.1/5118/1/OR3409946439172.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
Export Record
All Records
Export
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Adjust your hit list
Sort Your Results
Refine Search Result
More Options
Sort Your Results
Sort by:
Relevance
Author, ZA
Author, AZ
Title, AZ
Title, ZA
Date of publication, descending
Date of publication, ascending
Refine Search Result
Author
(572) Fleischer, M.
(568) Andreev, V.
(567) Ferencei, J.
(566) Straumann, U.
(565) Belousov, A.
(565) Boudry, V.
(565) Favart, L.
(565) Kleinwort, C.
(565) Pitzl, D.
(564) Brisson, V.
(564) Fedotov, A.
(564) Fomenko, A.
(564) Meyer, J.
(564) Nowak, G.
(564) Pascaud, C.
(564) Rostovtsev, A.
(564) Stella, B.
(564) Turnau, J.
(563) Gabathuler, E.
(563) Grab, C.
(563) Greenshaw, T.
(563) Haidt, D.
(563) Lebedev, A.
(563) Levonian, S.
(563) Mehta, A.
(563) Rusakov, S.
(562) Egli, S.
(562) Klein, M.
(562) Reimer, P.
(562) Robmann, P.
(562) Wegener, D.
(562) Zomer, F.
(561) Mikocki, S.
(561) Roosen, R.
(560) Cvach, J.
(559) Kostka, P.
(559) Lange, W.
(558) Niebuhr, C.
(557) Goerlich, L.
(557) Gogitidze, N.
(556) Elsen, E.
(556) Felst, R.
(556) Meyer, H.
(553) Bartel, W.
(552) Zhang, Z.
(551) Daum, K.
(551) Jung, H.
(551) Perez, E.
(549) Henschel, H.
(549) Horisberger, R.
(549) Rizvi, E.
(546) Bruncko, D.
(546) Sefkow, F.
(545) Barrelet, E.
(545) Delcourt, B.
(545) Lubimov, V.
(544) Moreau, F.
(543) Ozerov, D.
(540) Hoffmann, D.
(539) Malinovski, E.
(532) Jacquet, M.
(530) Zhokin, A.
(529) Van Mechelen, P.
(527) Vazdik, Y.
(524) Povh, B.
(521) Diaconu, C.
(517) List, B.
(517) Soloviev, Y.
(514) Spaskov, V.
(510) Sloan, T.
(509) Kapichine, M.
(505) Gayler, J.
(505) Schoeffel, L.
(504) Buschhorn, G.
(504) Marage, P.
(503) Traynor, D.
(501) Morozov, A.
(498) Lendermann, V.
(492) Dodonov, V.
(487) Bunyatyan, A.
(485) Janssen, X.
(484) Grindhammer, G.
(482) Herrera, G.
(464) Eckerlin, G.
(463) Kiesling, C.
(461) Schmitt, S.
(456) Hildebrandt, M.
(454) Efremenko, V.
(452) Laycock, P.
(447) Bystritskaya, L.
(447) South, D.
(438) Dubak, A.
(438) Glazov, A.
(437) Cozzika, G.
(434) Chekelian, V.
(428) Specka, A.
(426) Petrukhin, A.
(425) Feltesse, J.
(414) Valkarova, A.
(409) Kluge, T.
Author:
Subject
(139) experiment hep
(109) physics
(107) physics and astronomy
(75) particle physics experiment
(68) info eu repo classification ddc 530
(62) particles fields
(49) phys hexp physics high energy physics experiment
(44) deep inelastic scattering
(44) liquid argon calorimeter
(43) multidisciplinary
(40) cross section
(33) parton distributions
(29) hadron collisions
(25) research article
(24) cross sections
(24) lepton nucleon scattering
(23) article
(23) calorimeter
(23) perturbation theory
(19) momentum transfer
(18) calibration
(18) ep scattering
(17) ddc 610
(17) initial state radiation
(17) qcd analysis
(16) centre of mass
(15) monte carlo generator
(14) scattering
(13) lead scintillating fiber calorimeter
(13) perturbative qcd
(13) standard model
(12) cell parameters
(12) crystal structure
(12) crystal system
(12) current cross sections
(12) experimental 3d coordinates
(12) space group
(11) ep collisions
(11) proton
(11) qcd
(10) generator
(10) next to leading order
(10) nye funktionelle materialer
(9) confidence level
(9) h1
(9) hera
(9) high energy physics phenomenology
(9) model
(9) o alpha s corrections
(8) detector
(8) energy ep collisions
(8) ncebp 12 human reproduction
(8) photoproduction
(8) small x
(7) event generator
(7) leading order
(7) neutral current
(7) physics event generation
(7) proton collisions
(7) quantum chromodynamics
(6) colliders
(6) energy
(6) h1 detector
(6) kinematic reconstruction
(6) large rapidity gap
(6) luminance
(6) mass
(6) particle physics phenomenology
(6) photon
(6) qcd coherence
(5) annihilation
(5) boson production
(5) carlo generator cascade
(5) doaj health sciences
(5) doaj medicine general
(5) hard scattering
(5) hep ex
(5) jet cross sections
(5) jet fragmentation
(5) lcc medicine
(5) lcc r
(5) lepton production
(5) low q 2
(5) low x
(5) lund monte carlo
(5) monte carlo
(5) original articles
(5) p p over bar collisions
(5) phase space
(5) to leading order
(4) alpha s
(4) atomic particle
(4) charged current
(4) clustering algorithms
(4) collisions
(4) d asterisk
(4) data collection
(4) detectors and experimental techniques
(4) dijet production
(4) e e collisions
Subject:
Dewey Decimal Classification (DDC)
(88) Physics [53*]
(55) Medicine & health [61*]
(14) Animals (Zoology) [59*]
(13) Chemistry [54*]
(13) Life sciences; biology [57*]
(7) Earth sciences & geology [55*]
(6) Economics [33*]
(5) Computer science, knowledge & systems [00*]
(5) Science [50*]
(5) Mathematics [51*]
(3) Astronomy [52*]
(3) Engineering [62*]
(2) Social problems & social services [36*]
(2) Geography & travel [91*]
(1) Psychology [15*]
(1) Other religions [29*]
(1) Social sciences, sociology & anthropology...
(1) Public administration & military science [35*]
(1) Linguistics [41*]
(1) Plants (Botany) [58*]
(1) Technology [60*]
(1) Agriculture [63*]
(1) Manufacturing [67*]
(1) Landscaping & area planning [71*]
(1) Literature, rhetoric & criticism [80*]
Dewey Decimal Classification (DDC):
Year of Publication
(228) 2010
(123) 2009
(103) 2012
(95) 2011
(84) 2006
(77) 2002
(74) 2001
(73) 2005
(72) 2008
(71) 2013
(68) 2004
(67) 2000
(64) 2007
(62) 2003
(52) 1999
(45) 1997
(39) 1998
(35) 2014
(32) 1996
(31) 1995
(29) 1994
(16) 1993
(10) 1992
(6) 2015
(4) 1990
(3) 1979
(3) 1991
(2) 1981
(2) 1989
(1) 1975
(1) 1977
(1) 1978
(1) 1980
(1) 1982
(1) 1983
(1) 1986
(1) 1988
Year of Publication:
Content Provider
(195) Athens National Technical Univ.: DSpace
(189) Aachen RWTH: Publications
(171) STFC (United Kingdom)
(142) Joint Inst. for Nuclear Research: JINR Document...
(128) DESY Hamburg
(107) Lund Univ. Publications (LUP)
(85) CERN (Switzerland)
(76) Oxford Univ.: Research Archive (ORA)
(64) CiteSeerX
(53) PubMed Central
(49) HAL  Hyper Article en Ligne
(44) Springer Open Choice
(18) HighWire Press
(17) Smithsonian Institution
(16) DataCite Metadata Store
(15) Bielefeld Univ.: Publications
(11) Nijmegen Univ.
(10) ArXiv.org
(10) Denmark Technical Univ.: DTU Orbit
(10) German Medial Science (EJournal)
(8) London Univ. College: UCL Discovery
(7) DOAJ Articles
(7) African Journals Online
(7) Inst. Nat. Fisica Nucleare (INFN): OA Repository
(7) Glasgow Univ.
(6) Aalborg Univ. (AAU): VBN
(6) Bochum Univ. (RUB): Campus Research Bibliography
(6) Aarhus Univ.: Pure
(5) Tropical Medicine Inst. (ITM): TropMed Central...
(5) Munich TU: mediaTUM
(5) Utrecht Univ.: Repository
(5) Amsterdam VU: VUDARE
(4) Adelaide Univ.: Digital Library
(3) Bioline International
(3) Jülich Forschungszentrum: JuSER
(3) LSHTM: Research Online
(3) MaxDelbrueckCenter for Molecular Medicin (MDC)
(3) NASA Technical Reports Server (NTRS)
(3) Strathclyde Univ.
(2) USDA NAL (USA)
(2) Alfred Wegener Inst.: ePIC
(2) BioMed Central
(2) Göteborg Chalmers Univ. of Technology
(2) CSIC (Spanish National Research Council)
(2) Aachen Univ. of Applied Sciences: Publications
(2) Helmholtz Zentrum Berlin (HZB): Publications
(2) Iowa State Univ.: Digital Repository
(2) African Ethnomedicines Network: EJournals
(2) Munich LMU: Open Access
(2) Southampton Univ.: ePrints Soton
(2) Southern Denmark Univ.: Research Output
(2) Groningen Univ.
(2) Michigan Univ.: Deep Blue
(2) Twente Univ.: Publications
(2) VLIZ: OMA (Belgium)
(1) Caltech: Authors
(1) California Univ.: eScholarship
(1) Chapman Univ.: Digital Commons
(1) Copenhagen Univ.: CURIS
(1) German Aerospace Center (DLR)
(1) Dove Medical Press
(1) FraunhoferGesellschaft: ePrints
(1) Harvard Univ.: DASH
(1) Hindawi Publishing Corporation
(1) Berlin HU: edoc
(1) London Imperial Coll.
(1) Jackson Laboratory (JAX): Mouseion
(1) James Cook Univ. (JCU): ResearchOnline
(1) KNAW (Koninklijke Ned. Akad. van...
(1) Max Planck Society: eDoc Server
(1) Massachusetts Inst. of Technology (MIT)
(1) Heinz MaierLeibnitz Zentrum (MLZ): iMPULSE
(1) GEOMAR Helmholtz Zentrum für Ozeanforschung:...
(1) Liège Univ.: ORBi
(1) OSTI DOE (USA)
(1) Plymouth Marine Science Electronic Archive...
(1) London St George Univ.: Repository
(1) Berlin TU, Physics: EPrints
(1) Lancester Univ.
(1) Nevada Univ. Las Vegas: Research and Scholarship
(1) Amsterdam Univ.: DARE
(1) Antwerp Univ.: IRUA
(1) Basel Univ.: edoc
(1) Cork Open Research Archive
(1) Eindhoven Univ. of Technology: Repository TU/e
(1) Ghent Univ.
(1) Hasselt Univ.
(1) Manchester Univ.: eScholar Services
(1) NebraskaLincoln Univ. (UNL): DigitalCommons
(1) Queensland Univ.: UQ eSpace
(1) Rotterdam Erasmus Univ.: RePub
(1) Hong Kong Univ. of Science and Technology
(1) Sussex Univ.
(1) Tübingen Univ.: Publication System
(1) Wageningen UR: Digital Library
(1) Zurich Univ.: ZORA
Content Provider:
Language
(816) Unknown
(750) English
(13) German
Language:
Document Type
(607) Article, Journals
(472) Unknown
(470) Text
(23) Reports, Papers, Lectures
(6) Books
(1) Theses
Document Type:
Access
(1,235) Unknown
(344) Open Access
Access:
More Options
»
Search History
»
Get RSS Feed
»
Get ATOM Feed
»
Email this Search
»
Save Search
»
Browsing
»
Search Plugin
Further result pages
Results:
1

2

3

4

5

6

7

8

9

10

11
Next »
[100]
New Search »
Currently in BASE: 72,045,933 Documents of 3,464
Content Sources
About BASE

Contact

BASE Lab

Imprint
© 20042015 by
Bielefeld University Library
Search powered by
Solr
&
VuFind
.
Suggest Repository
BASE Interfaces
Currently in BASE: 72,045,933 Documents of 3,464 Content Sources
http://www.basesearch.net